Base | Representation |
---|---|
bin | 1011000111010011000101… |
… | …0111001001110010011111 |
3 | 1121021012222111220201000011 |
4 | 2301310301113021302133 |
5 | 3100203040042010421 |
6 | 41553443430144051 |
7 | 2400603146051656 |
oct | 261646127116237 |
9 | 47235874821004 |
10 | 12220010110111 |
11 | 399152814a991 |
12 | 14543a07b2027 |
13 | 6a845a5163ab |
14 | 30364745819d |
15 | 162d0ce5b4e1 |
hex | b1d315c9c9f |
12220010110111 has 8 divisors (see below), whose sum is σ = 12260665613664. Its totient is φ = 12179364887040.
The previous prime is 12220010110037. The next prime is 12220010110141. The reversal of 12220010110111 is 11101101002221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12220010110111 - 213 = 12220010101919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12220010110091 and 12220010110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220010110141) 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, 185170 + ... + 4947151.
It is an arithmetic number, because the mean of its divisors is an integer number (1532583201708).
Almost surely, 212220010110111 is an apocalyptic number.
12220010110111 is a deficient number, since it is larger than the sum of its proper divisors (40655503553).
12220010110111 is an equidigital number, since it uses as much as digits as its factorization.
12220010110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5140241.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12220010110111 its reverse (11101101002221), we get a palindrome (23321111112332).
The spelling of 12220010110111 in words is "twelve trillion, two hundred twenty billion, ten million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •