Search a number
-
+
151026513 = 31123113421
BaseRepresentation
bin10010000000001…
…11101101010001
3101112011221102120
421000013231101
5302130322023
622553004453
73512463351
oct1100075521
9345157376
10151026513
1178283500
12426b3729
132539b201
14160b4b61
15d3d38e3
hex9007b51

151026513 has 24 divisors (see below), whose sum is σ = 228496128. Its totient is φ = 88572000.

The previous prime is 151026511. The next prime is 151026517. The reversal of 151026513 is 315620151.

It is not a de Polignac number, because 151026513 - 21 = 151026511 is a prime.

It is not an unprimeable number, because it can be changed into a prime (151026511) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4543 + ... + 17963.

It is an arithmetic number, because the mean of its divisors is an integer number (9520672).

Almost surely, 2151026513 is an apocalyptic number.

It is an amenable number.

151026513 is a deficient number, since it is larger than the sum of its proper divisors (77469615).

151026513 is a wasteful number, since it uses less digits than its factorization.

151026513 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 13477 (or 13466 counting only the distinct ones).

The product of its (nonzero) digits is 900, while the sum is 24.

The square root of 151026513 is about 12289.2844787644. The cubic root of 151026513 is about 532.5385667145.

Adding to 151026513 its reverse (315620151), we get a palindrome (466646664).

The spelling of 151026513 in words is "one hundred fifty-one million, twenty-six thousand, five hundred thirteen".

Divisors: 1 3 11 31 33 93 121 341 363 1023 3751 11253 13421 40263 147631 416051 442893 1248153 1623941 4576561 4871823 13729683 50342171 151026513