Base | Representation |
---|---|
bin | 1010111011101010011100… |
… | …0110111100100010011111 |
3 | 1120120010000222101012121220 |
4 | 2232322213012330202133 |
5 | 3033414202230010421 |
6 | 41321545020424423 |
7 | 2350265555066403 |
oct | 256724706744237 |
9 | 46503028335556 |
10 | 12020122110111 |
11 | 3914783626a75 |
12 | 14216b66a8113 |
13 | 69265347ca0b |
14 | 2d7ac41ad103 |
15 | 15ca0e75c3c6 |
hex | aeea71bc89f |
12020122110111 has 8 divisors (see below), whose sum is σ = 16206906216240. Its totient is φ = 7923376372032.
The previous prime is 12020122110103. The next prime is 12020122110119. The reversal of 12020122110111 is 11101122102021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12020122110103) and next prime (12020122110119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12020122110111 - 23 = 12020122110103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020122110119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22509591700 + ... + 22509592233.
It is an arithmetic number, because the mean of its divisors is an integer number (2025863277030).
Almost surely, 212020122110111 is an apocalyptic number.
12020122110111 is a deficient number, since it is larger than the sum of its proper divisors (4186784106129).
12020122110111 is an equidigital number, since it uses as much as digits as its factorization.
12020122110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45019184025.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12020122110111 its reverse (11101122102021), we get a palindrome (23121244212132).
The spelling of 12020122110111 in words is "twelve trillion, twenty billion, one hundred twenty-two million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •