Base | Representation |
---|---|
bin | 110000000001011000010000… |
… | …101001000001000010100010 |
3 | 1000200210121200220010112202212 |
4 | 300001120100221001002202 |
5 | 210140304122224013442 |
6 | 2025104222254042122 |
7 | 62325524456025566 |
oct | 6001302051010242 |
9 | 1020717626115685 |
10 | 211201001001122 |
11 | 61327929080410 |
12 | 1b830203aa9342 |
13 | 90b02271ccb52 |
14 | 3a2227c1a96a6 |
15 | 1963c519eaa82 |
hex | c01610a410a2 |
211201001001122 has 16 divisors (see below), whose sum is σ = 345601863840672. Its totient is φ = 96000392267520.
The previous prime is 211201001001083. The next prime is 211201001001127. The reversal of 211201001001122 is 221100100102112.
It is a junction number, because it is equal to n+sod(n) for n = 211201001001097 and 211201001001106.
It is not an unprimeable number, because it can be changed into a prime (211201001001127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56449133 + ... + 60074175.
It is an arithmetic number, because the mean of its divisors is an integer number (21600116490042).
Almost surely, 2211201001001122 is an apocalyptic number.
211201001001122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211201001001122 is a deficient number, since it is larger than the sum of its proper divisors (134400862839550).
211201001001122 is a wasteful number, since it uses less digits than its factorization.
211201001001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6273313.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211201001001122 its reverse (221100100102112), we get a palindrome (432301101103234).
The spelling of 211201001001122 in words is "two hundred eleven trillion, two hundred one billion, one million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •