Base | Representation |
---|---|
bin | 1011000000111101000010… |
… | …0000100101111000100001 |
3 | 1120212210122011212211002012 |
4 | 2300033100200211320201 |
5 | 3041411322304342004 |
6 | 41431415513202305 |
7 | 2356664100030131 |
oct | 260172040457041 |
9 | 46783564784065 |
10 | 12111011012129 |
11 | 394a283a8a327 |
12 | 1437241100395 |
13 | 69b0a94b1103 |
14 | 2dc267178ac1 |
15 | 16007db7246e |
hex | b03d0825e21 |
12111011012129 has 2 divisors, whose sum is σ = 12111011012130. Its totient is φ = 12111011012128.
The previous prime is 12111011012059. The next prime is 12111011012137. The reversal of 12111011012129 is 92121011011121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7776557667904 + 4334453344225 = 2788648^2 + 2081935^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111011012129 is a prime.
It is a super-3 number, since 3×121110110121293 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (12111011012159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055505506064 + 6055505506065.
It is an arithmetic number, because the mean of its divisors is an integer number (6055505506065).
Almost surely, 212111011012129 is an apocalyptic number.
It is an amenable number.
12111011012129 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111011012129 is an equidigital number, since it uses as much as digits as its factorization.
12111011012129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 12111011012129 in words is "twelve trillion, one hundred eleven billion, eleven million, twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •