Base | Representation |
---|---|
bin | 1001001001100110010011… |
… | …01101101011110111000100 |
3 | 2122020112211212000210112111 |
4 | 10210303021231223313010 |
5 | 10114130312304323022 |
6 | 110443244224030404 |
7 | 4144460260445152 |
oct | 444631155536704 |
9 | 78215755023474 |
10 | 20121011011012 |
11 | 645830018674a |
12 | 230b705a62404 |
13 | b2c531a92072 |
14 | 4d7c0d97a3d2 |
15 | 24d5d8995477 |
hex | 124cc9b6bdc4 |
20121011011012 has 12 divisors (see below), whose sum is σ = 35211878262316. Its totient is φ = 10060474364640.
The previous prime is 20121011010973. The next prime is 20121011011027. The reversal of 20121011011012 is 21011011012102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1653914314116 + 18467096696896 = 1286046^2 + 4297336^2 .
It is a super-2 number, since 2×201210110110122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20121011010983 and 20121011011001.
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 3 ways as a sum of consecutive naturals, for example, 6299943 + ... + 8940430.
Almost surely, 220121011011012 is an apocalyptic number.
It is an amenable number.
20121011011012 is a deficient number, since it is larger than the sum of its proper divisors (15090867251304).
20121011011012 is a wasteful number, since it uses less digits than its factorization.
20121011011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15570438 (or 15570436 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20121011011012 its reverse (21011011012102), we get a palindrome (41132022023114).
The spelling of 20121011011012 in words is "twenty trillion, one hundred twenty-one billion, eleven million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •