Base | Representation |
---|---|
bin | 1101101110111101111110… |
… | …01110001010111011110001 |
3 | 10221221012101012111222211221 |
4 | 12313132333032022323301 |
5 | 12424303400021034413 |
6 | 144122112055505041 |
7 | 6234646662512536 |
oct | 667367716127361 |
9 | 127835335458757 |
10 | 30201123221233 |
11 | 9694251797a68 |
12 | 347921b088181 |
13 | 13b0c5237c773 |
14 | 765a566d2d8d |
15 | 375901b6e68d |
hex | 1b77bf38aef1 |
30201123221233 has 2 divisors, whose sum is σ = 30201123221234. Its totient is φ = 30201123221232.
The previous prime is 30201123221183. The next prime is 30201123221257. The reversal of 30201123221233 is 33212232110203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25888324035249 + 4312799185984 = 5088057^2 + 2076728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30201123221233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30201123221198 and 30201123221207.
It is not a weakly prime, because it can be changed into another prime (30201123221833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100561610616 + 15100561610617.
It is an arithmetic number, because the mean of its divisors is an integer number (15100561610617).
Almost surely, 230201123221233 is an apocalyptic number.
It is an amenable number.
30201123221233 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201123221233 is an equidigital number, since it uses as much as digits as its factorization.
30201123221233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 30201123221233 its reverse (33212232110203), we get a palindrome (63413355331436).
The spelling of 30201123221233 in words is "thirty trillion, two hundred one billion, one hundred twenty-three million, two hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •