Base | Representation |
---|---|
bin | 101111101111111010110111… |
… | …000011011110001010010010 |
3 | 1000112112220210211211212211221 |
4 | 233233322313003132022102 |
5 | 210011124430220023442 |
6 | 2022345115335555254 |
7 | 62143041361522222 |
oct | 5757726703361222 |
9 | 1015486724755757 |
10 | 210001202111122 |
11 | 60a05011965234 |
12 | 1b67778182bb2a |
13 | 902404a49a756 |
14 | 39c0180672082 |
15 | 194292e7d8467 |
hex | befeb70de292 |
210001202111122 has 32 divisors (see below), whose sum is σ = 322660837638144. Its totient is φ = 102480161850000.
The previous prime is 210001202111119. The next prime is 210001202111123. The reversal of 210001202111122 is 221111202100012.
It is a super-2 number, since 2×2100012021111222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210001202111096 and 210001202111105.
It is not an unprimeable number, because it can be changed into a prime (210001202111123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5799504 + ... + 21298747.
It is an arithmetic number, because the mean of its divisors is an integer number (10083151176192).
Almost surely, 2210001202111122 is an apocalyptic number.
210001202111122 is a deficient number, since it is larger than the sum of its proper divisors (112659635527022).
210001202111122 is a wasteful number, since it uses less digits than its factorization.
210001202111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27098854.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 210001202111122 its reverse (221111202100012), we get a palindrome (431112404211134).
The spelling of 210001202111122 in words is "two hundred ten trillion, one billion, two hundred two million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •