Base | Representation |
---|---|
bin | 1011000010000100100011… |
… | …1010110001111000001111 |
3 | 1120221122012021001212121122 |
4 | 2300201020322301320033 |
5 | 3042220133004341421 |
6 | 41444313023551155 |
7 | 2361243636240353 |
oct | 260411072617017 |
9 | 46848167055548 |
10 | 12130211012111 |
11 | 3957436978505 |
12 | 143aabb15b4bb |
13 | 69cb49205b4a |
14 | 2dd1690d5463 |
15 | 1608045662ab |
hex | b0848eb1e0f |
12130211012111 has 4 divisors (see below), whose sum is σ = 12207473502792. Its totient is φ = 12052948521432.
The previous prime is 12130211012107. The next prime is 12130211012173. The reversal of 12130211012111 is 11121011203121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12130211012111 - 22 = 12130211012107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12130211012111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12130211812111) 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, 38631245105 + ... + 38631245418.
It is an arithmetic number, because the mean of its divisors is an integer number (3051868375698).
Almost surely, 212130211012111 is an apocalyptic number.
12130211012111 is a deficient number, since it is larger than the sum of its proper divisors (77262490681).
12130211012111 is an equidigital number, since it uses as much as digits as its factorization.
12130211012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77262490680.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 12130211012111 its reverse (11121011203121), we get a palindrome (23251222215232).
The spelling of 12130211012111 in words is "twelve trillion, one hundred thirty billion, two hundred eleven million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •