Base | Representation |
---|---|
bin | 1010001100100100010001… |
… | …0001101010000100011100 |
3 | 1110200202120120102111211120 |
4 | 2203021010101222010130 |
5 | 2432140122042401022 |
6 | 35502133354450540 |
7 | 2234653165501401 |
oct | 243110421520434 |
9 | 43622516374746 |
10 | 11211010122012 |
11 | 3632620a417a8 |
12 | 1310928733a50 |
13 | 6342697a2b0c |
14 | 2aa889a002a8 |
15 | 14695651bd5c |
hex | a324446a11c |
11211010122012 has 48 divisors (see below), whose sum is σ = 26242628106240. Its totient is φ = 3725078916672.
The previous prime is 11211010122001. The next prime is 11211010122043. The reversal of 11211010122012 is 21022101011211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11211010121982 and 11211010122000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3523314 + ... + 5902182.
It is an arithmetic number, because the mean of its divisors is an integer number (546721418880).
Almost surely, 211211010122012 is an apocalyptic number.
11211010122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11211010122012 is an abundant number, since it is smaller than the sum of its proper divisors (15031617984228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211010122012 is a wasteful number, since it uses less digits than its factorization.
11211010122012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2380130 (or 2380128 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11211010122012 its reverse (21022101011211), we get a palindrome (32233111133223).
The spelling of 11211010122012 in words is "eleven trillion, two hundred eleven billion, ten million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •