Base | Representation |
---|---|
bin | 1010111011000101000111… |
… | …0111101011101110010010 |
3 | 1120112011011122222112001020 |
4 | 2232301101313223232102 |
5 | 3033233142120023442 |
6 | 41313210441220310 |
7 | 2346462345361353 |
oct | 256612167535622 |
9 | 46464148875036 |
10 | 12010102111122 |
11 | 39105015a2475 |
12 | 141b77aa91696 |
13 | 6917175ac72b |
14 | 2d7413521d2a |
15 | 15c624c4d9ec |
hex | aec51debb92 |
12010102111122 has 8 divisors (see below), whose sum is σ = 24020204222256. Its totient is φ = 4003367370372.
The previous prime is 12010102111121. The next prime is 12010102111153. The reversal of 12010102111122 is 22111120101021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
12010102111122 is an admirable number.
It is a super-4 number, since 4×120101021111224 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (12010102111121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000841842588 + ... + 1000841842599.
It is an arithmetic number, because the mean of its divisors is an integer number (3002525527782).
Almost surely, 212010102111122 is an apocalyptic number.
12010102111122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12010102111122 is a wasteful number, since it uses less digits than its factorization.
12010102111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2001683685192.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12010102111122 its reverse (22111120101021), we get a palindrome (34121222212143).
The spelling of 12010102111122 in words is "twelve trillion, ten billion, one hundred two million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •