Base | Representation |
---|---|
bin | 1101101001011101111011… |
… | …10011111111011100111111 |
3 | 10221021010112022112101101001 |
4 | 12310232331303333130333 |
5 | 12413204310440121343 |
6 | 143455213354431131 |
7 | 6215206223353456 |
oct | 664567563773477 |
9 | 127233468471331 |
10 | 30012121020223 |
11 | 96210839a0a41 |
12 | 34486727324a7 |
13 | 1399191697174 |
14 | 75a8470abb9d |
15 | 370a3dea244d |
hex | 1b4bbdcff73f |
30012121020223 has 2 divisors, whose sum is σ = 30012121020224. Its totient is φ = 30012121020222.
The previous prime is 30012121020209. The next prime is 30012121020229. The reversal of 30012121020223 is 32202012121003.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30012121020223 - 213 = 30012121012031 is a prime.
It is a super-4 number, since 4×300121210202234 (a number of 55 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 30012121020223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30012121020229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15006060510111 + 15006060510112.
It is an arithmetic number, because the mean of its divisors is an integer number (15006060510112).
Almost surely, 230012121020223 is an apocalyptic number.
30012121020223 is a deficient number, since it is larger than the sum of its proper divisors (1).
30012121020223 is an equidigital number, since it uses as much as digits as its factorization.
30012121020223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 30012121020223 its reverse (32202012121003), we get a palindrome (62214133141226).
The spelling of 30012121020223 in words is "thirty trillion, twelve billion, one hundred twenty-one million, twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •