Base | Representation |
---|---|
bin | 1001001001100110011111… |
… | …01011100000001100000100 |
3 | 2122020120002211100221211222 |
4 | 10210303033223200030010 |
5 | 10114131013420232322 |
6 | 110443302201215512 |
7 | 4144462614300221 |
oct | 444631753401404 |
9 | 78216084327758 |
10 | 20121111102212 |
11 | 645835172a74a |
12 | 230b733491598 |
13 | b2c549738223 |
14 | 4d7c1cd92948 |
15 | 24d5e2666e42 |
hex | 124ccfae0304 |
20121111102212 has 6 divisors (see below), whose sum is σ = 35211944428878. Its totient is φ = 10060555551104.
The previous prime is 20121111102199. The next prime is 20121111102227. The reversal of 20121111102212 is 21220111112102.
It can be written as a sum of positive squares in only one way, i.e., 18012011331136 + 2109099771076 = 4244056^2 + 1452274^2 .
It is a super-2 number, since 2×201211111022122 (a number of 27 digits) contains 22 as substring.
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 as a sum of consecutive naturals, namely, 2515138887773 + ... + 2515138887780.
It is an arithmetic number, because the mean of its divisors is an integer number (5868657404813).
Almost surely, 220121111102212 is an apocalyptic number.
It is an amenable number.
20121111102212 is a deficient number, since it is larger than the sum of its proper divisors (15090833326666).
20121111102212 is a wasteful number, since it uses less digits than its factorization.
20121111102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5030277775557 (or 5030277775555 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20121111102212 its reverse (21220111112102), we get a palindrome (41341222214314).
The spelling of 20121111102212 in words is "twenty trillion, one hundred twenty-one billion, one hundred eleven million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •