Base | Representation |
---|---|
bin | 1101111011110101100110… |
… | …10010100100110111110111 |
3 | 11000111110201120221112111121 |
4 | 12331322303102210313313 |
5 | 13004024441444242301 |
6 | 145101201223044411 |
7 | 6311622441064324 |
oct | 675726322446767 |
9 | 130443646845447 |
10 | 30643304680951 |
11 | 9844830694376 |
12 | 352aa648a0707 |
13 | 14138609acb11 |
14 | 77d202a75b4b |
15 | 3821818083a1 |
hex | 1bdeb34a4df7 |
30643304680951 has 2 divisors, whose sum is σ = 30643304680952. Its totient is φ = 30643304680950.
The previous prime is 30643304680853. The next prime is 30643304680969. The reversal of 30643304680951 is 15908640334603.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30643304680951 - 227 = 30643170463223 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30643304680981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15321652340475 + 15321652340476.
It is an arithmetic number, because the mean of its divisors is an integer number (15321652340476).
Almost surely, 230643304680951 is an apocalyptic number.
30643304680951 is a deficient number, since it is larger than the sum of its proper divisors (1).
30643304680951 is an equidigital number, since it uses as much as digits as its factorization.
30643304680951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5598720, while the sum is 52.
The spelling of 30643304680951 in words is "thirty trillion, six hundred forty-three billion, three hundred four million, six hundred eighty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •