Base | Representation |
---|---|
bin | 11100010011010110… |
… | …110000001001010111 |
3 | 2220102220012200102112 |
4 | 130103112300021113 |
5 | 444214203040201 |
6 | 21543304301235 |
7 | 2124036336542 |
oct | 342326601127 |
9 | 86386180375 |
10 | 30389502551 |
11 | 1198509a071 |
12 | 5a8147181b |
13 | 2b33c9c595 |
14 | 1684079859 |
15 | bcce170bb |
hex | 7135b0257 |
30389502551 has 2 divisors, whose sum is σ = 30389502552. Its totient is φ = 30389502550.
The previous prime is 30389502529. The next prime is 30389502553. The reversal of 30389502551 is 15520598303.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30389502551 - 26 = 30389502487 is a prime.
Together with 30389502553, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 30389502499 and 30389502508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30389502553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15194751275 + 15194751276.
It is an arithmetic number, because the mean of its divisors is an integer number (15194751276).
Almost surely, 230389502551 is an apocalyptic number.
30389502551 is a deficient number, since it is larger than the sum of its proper divisors (1).
30389502551 is an equidigital number, since it uses as much as digits as its factorization.
30389502551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 30389502551 in words is "thirty billion, three hundred eighty-nine million, five hundred two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •