Base | Representation |
---|---|
bin | 1101101111010000100101… |
… | …00011010010010101111010 |
3 | 10221222011011021122220002222 |
4 | 12313220102203102111322 |
5 | 12424434323431400442 |
6 | 144130443132524042 |
7 | 6235452333106526 |
oct | 667502243222572 |
9 | 127864137586088 |
10 | 30211111200122 |
11 | 9698507741376 |
12 | 347b148020622 |
13 | 13b1b8471b448 |
14 | 766323006d86 |
15 | 375cd89558d2 |
hex | 1b7a128d257a |
30211111200122 has 8 divisors (see below), whose sum is σ = 45740187050976. Its totient is φ = 14964382183132.
The previous prime is 30211111200119. The next prime is 30211111200143. The reversal of 30211111200122 is 22100211111203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×302111112001222 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30211111200122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 70586708198 + ... + 70586708625.
It is an arithmetic number, because the mean of its divisors is an integer number (5717523381372).
Almost surely, 230211111200122 is an apocalyptic number.
30211111200122 is a deficient number, since it is larger than the sum of its proper divisors (15529075850854).
30211111200122 is a wasteful number, since it uses less digits than its factorization.
30211111200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141173416932.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 30211111200122 its reverse (22100211111203), we get a palindrome (52311322311325).
The spelling of 30211111200122 in words is "thirty trillion, two hundred eleven billion, one hundred eleven million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.308 sec. • engine limits •