Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …11111101110010110011111 |
3 | 10221221012120210020110000012 |
4 | 12313133003333232112133 |
5 | 12424304031022221343 |
6 | 144122124040353435 |
7 | 6234651654400355 |
oct | 667370377562637 |
9 | 127835523213005 |
10 | 30201203320223 |
11 | 9694292a26581 |
12 | 3479241a7587b |
13 | 13b0c65b45c10 |
14 | 765a631c37d5 |
15 | 375908be2718 |
hex | 1b77c3fee59f |
30201203320223 has 4 divisors (see below), whose sum is σ = 32524372806408. Its totient is φ = 27878033834040.
The previous prime is 30201203320201. The next prime is 30201203320307. The reversal of 30201203320223 is 32202330210203.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 30201203320223 - 214 = 30201203303839 is a prime.
It is a super-2 number, since 2×302012033202232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201203320723) 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, 1161584743073 + ... + 1161584743098.
It is an arithmetic number, because the mean of its divisors is an integer number (8131093201602).
Almost surely, 230201203320223 is an apocalyptic number.
30201203320223 is a deficient number, since it is larger than the sum of its proper divisors (2323169486185).
30201203320223 is a wasteful number, since it uses less digits than its factorization.
30201203320223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2323169486184.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 30201203320223 its reverse (32202330210203), we get a palindrome (62403533530426).
The spelling of 30201203320223 in words is "thirty trillion, two hundred one billion, two hundred three million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •