Base | Representation |
---|---|
bin | 1011000001011110111001… |
… | …0100100010000110111011 |
3 | 1120220200002200111020011211 |
4 | 2300113232110202012323 |
5 | 3042033431340231021 |
6 | 41435521513303551 |
7 | 2360435255356660 |
oct | 260275624420673 |
9 | 46820080436154 |
10 | 12120101102011 |
11 | 3953119113401 |
12 | 1438b59404bb7 |
13 | 69bbc7815216 |
14 | 2dc88a521a67 |
15 | 160411be73e1 |
hex | b05ee5221bb |
12120101102011 has 16 divisors (see below), whose sum is σ = 14393440051200. Its totient is φ = 9985448960928.
The previous prime is 12120101101963. The next prime is 12120101102027. The reversal of 12120101102011 is 11020110102121.
It is a happy number.
12120101102011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12120101102011 - 225 = 12120067547579 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12120101101982 and 12120101102000.
It is not an unprimeable number, because it can be changed into a prime (12120101102311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133822291 + ... + 133912828.
It is an arithmetic number, because the mean of its divisors is an integer number (899590003200).
Almost surely, 212120101102011 is an apocalyptic number.
12120101102011 is a deficient number, since it is larger than the sum of its proper divisors (2273338949189).
12120101102011 is a wasteful number, since it uses less digits than its factorization.
12120101102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267735378.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12120101102011 its reverse (11020110102121), we get a palindrome (23140211204132).
The spelling of 12120101102011 in words is "twelve trillion, one hundred twenty billion, one hundred one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •