Base | Representation |
---|---|
bin | 1101110000011100111101… |
… | …10111111010011101010111 |
3 | 10222010002000021012000220201 |
4 | 12320032132313322131113 |
5 | 12431122320222420343 |
6 | 144201344312241331 |
7 | 6241433511154225 |
oct | 670163667723527 |
9 | 128102007160821 |
10 | 30252120123223 |
11 | 9703941158259 |
12 | 34870919a0247 |
13 | 13b59bb81350b |
14 | 7682d35a5b15 |
15 | 376dd8cd294d |
hex | 1b839edfa757 |
30252120123223 has 2 divisors, whose sum is σ = 30252120123224. Its totient is φ = 30252120123222.
The previous prime is 30252120123187. The next prime is 30252120123233. The reversal of 30252120123223 is 32232102125203.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30252120123223 - 29 = 30252120122711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30252120123191 and 30252120123200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30252120123233) 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, 15126060061611 + 15126060061612.
It is an arithmetic number, because the mean of its divisors is an integer number (15126060061612).
Almost surely, 230252120123223 is an apocalyptic number.
30252120123223 is a deficient number, since it is larger than the sum of its proper divisors (1).
30252120123223 is an equidigital number, since it uses as much as digits as its factorization.
30252120123223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 30252120123223 its reverse (32232102125203), we get a palindrome (62484222248426).
The spelling of 30252120123223 in words is "thirty trillion, two hundred fifty-two billion, one hundred twenty million, one hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •