Base | Representation |
---|---|
bin | 1101101110111101111011… |
… | …10101101011000101011111 |
3 | 10221221012022120212100122012 |
4 | 12313132331311223011133 |
5 | 12424303323101201421 |
6 | 144122105510341435 |
7 | 6234646261360604 |
oct | 667367565530537 |
9 | 127835276770565 |
10 | 30201100022111 |
11 | 969423a692137 |
12 | 347921335a87b |
13 | 13b0c4a619185 |
14 | 765a535b46ab |
15 | 3758eeada95b |
hex | 1b77bdd6b15f |
30201100022111 has 4 divisors (see below), whose sum is σ = 30201839434272. Its totient is φ = 30200360609952.
The previous prime is 30201100022087. The next prime is 30201100022129. The reversal of 30201100022111 is 11122000110203.
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 30201100022111 - 26 = 30201100022047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201100022161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 369644810 + ... + 369726503.
It is an arithmetic number, because the mean of its divisors is an integer number (7550459858568).
Almost surely, 230201100022111 is an apocalyptic number.
30201100022111 is a deficient number, since it is larger than the sum of its proper divisors (739412161).
30201100022111 is an equidigital number, since it uses as much as digits as its factorization.
30201100022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739412160.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 30201100022111 its reverse (11122000110203), we get a palindrome (41323100132314).
The spelling of 30201100022111 in words is "thirty trillion, two hundred one billion, one hundred million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •