Base | Representation |
---|---|
bin | 1011000111010110110100… |
… | …0010000010111110010001 |
3 | 1121021022120021122212001121 |
4 | 2301311231002002332101 |
5 | 3100212112332211004 |
6 | 41554131031202241 |
7 | 2400640023213631 |
oct | 261655502027621 |
9 | 47238507585047 |
10 | 12221011210129 |
11 | 39919a1255177 |
12 | 145461bb16381 |
13 | 6a8589a4a177 |
14 | 3037003b06c1 |
15 | 162d6aca8854 |
hex | b1d6d082f91 |
12221011210129 has 2 divisors, whose sum is σ = 12221011210130. Its totient is φ = 12221011210128.
The previous prime is 12221011210117. The next prime is 12221011210141. The reversal of 12221011210129 is 92101211012221.
It is a balanced prime because it is at equal distance from previous prime (12221011210117) and next prime (12221011210141).
It can be written as a sum of positive squares in only one way, i.e., 12106328742225 + 114682467904 = 3479415^2 + 338648^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221011210129 - 213 = 12221011201937 is a prime.
It is a super-2 number, since 2×122210112101292 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12221011210189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110505605064 + 6110505605065.
It is an arithmetic number, because the mean of its divisors is an integer number (6110505605065).
Almost surely, 212221011210129 is an apocalyptic number.
It is an amenable number.
12221011210129 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221011210129 is an equidigital number, since it uses as much as digits as its factorization.
12221011210129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 12221011210129 in words is "twelve trillion, two hundred twenty-one billion, eleven million, two hundred ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •