Base | Representation |
---|---|
bin | 1101101110111101111110… |
… | …00110110101111011111111 |
3 | 10221221012101001220101201102 |
4 | 12313132333012311323333 |
5 | 12424303344023101343 |
6 | 144122111550403315 |
7 | 6234646640262116 |
oct | 667367706657377 |
9 | 127835331811642 |
10 | 30201121300223 |
11 | 96942506a5755 |
12 | 347921a50053b |
13 | 13b0c51b59283 |
14 | 765a56352c7d |
15 | 3759018e03b8 |
hex | 1b77bf1b5eff |
30201121300223 has 4 divisors (see below), whose sum is σ = 30202728873240. Its totient is φ = 30199513727208.
The previous prime is 30201121300219. The next prime is 30201121300237. The reversal of 30201121300223 is 32200312110203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30201121300223 - 22 = 30201121300219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30201121300195 and 30201121300204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201121900223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 803758328 + ... + 803795901.
It is an arithmetic number, because the mean of its divisors is an integer number (7550682218310).
Almost surely, 230201121300223 is an apocalyptic number.
30201121300223 is a deficient number, since it is larger than the sum of its proper divisors (1607573017).
30201121300223 is a wasteful number, since it uses less digits than its factorization.
30201121300223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1607573016.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30201121300223 its reverse (32200312110203), we get a palindrome (62401433410426).
The spelling of 30201121300223 in words is "thirty trillion, two hundred one billion, one hundred twenty-one million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •