Base | Representation |
---|---|
bin | 1001100011110001001100… |
… | …10010000010110110101000 |
3 | 2202102111211201201122022100 |
4 | 10301320212102002312220 |
5 | 10223343343311223422 |
6 | 112412315134253400 |
7 | 4266442311521052 |
oct | 461704622026650 |
9 | 82374751648270 |
10 | 21020212211112 |
11 | 6774692885334 |
12 | 2435a36657260 |
13 | b96274bc85ba |
14 | 529552c2a8d2 |
15 | 266bb5cd57ac |
hex | 131e26482da8 |
21020212211112 has 48 divisors (see below), whose sum is σ = 57115180362240. Its totient is φ = 6983914147488.
The previous prime is 21020212211077. The next prime is 21020212211143. The reversal of 21020212211112 is 21111221202012.
21020212211112 is a `hidden beast` number, since 210 + 20 + 212 + 211 + 1 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 475462248 + ... + 475506455.
It is an arithmetic number, because the mean of its divisors is an integer number (1189899590880).
Almost surely, 221020212211112 is an apocalyptic number.
It is an amenable number.
21020212211112 is an abundant number, since it is smaller than the sum of its proper divisors (36094968151128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21020212211112 is a wasteful number, since it uses less digits than its factorization.
21020212211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950969022 (or 950969015 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21020212211112 its reverse (21111221202012), we get a palindrome (42131433413124).
The spelling of 21020212211112 in words is "twenty-one trillion, twenty billion, two hundred twelve million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •