Base | Representation |
---|---|
bin | 1001000110010111101111… |
… | …00100100001011011010110 |
3 | 2121211221121001111020220021 |
4 | 10203023313210201123112 |
5 | 10110321201432224342 |
6 | 110320303532255354 |
7 | 4133453131631536 |
oct | 443136744413326 |
9 | 77757531436807 |
10 | 20010111211222 |
11 | 6415271130750 |
12 | 22b211591155a |
13 | b21c3a03b962 |
14 | 4d26cd08d4c6 |
15 | 24a7978b0567 |
hex | 1232f79216d6 |
20010111211222 has 64 divisors (see below), whose sum is σ = 34796328779520. Its totient is φ = 8529286348800.
The previous prime is 20010111211147. The next prime is 20010111211253. The reversal of 20010111211222 is 22211211101002.
It is a junction number, because it is equal to n+sod(n) for n = 20010111211196 and 20010111211205.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 308713197 + ... + 308778007.
It is an arithmetic number, because the mean of its divisors is an integer number (543692637180).
Almost surely, 220010111211222 is an apocalyptic number.
20010111211222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20010111211222 is a deficient number, since it is larger than the sum of its proper divisors (14786217568298).
20010111211222 is a wasteful number, since it uses less digits than its factorization.
20010111211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67837.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20010111211222 its reverse (22211211101002), we get a palindrome (42221322312224).
It can be divided in two parts, 200101 and 11211222, that multiplied together give a palindrome (2243376733422).
The spelling of 20010111211222 in words is "twenty trillion, ten billion, one hundred eleven million, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •