Base | Representation |
---|---|
bin | 101010111001000110… |
… | …0100010000100101001 |
3 | 22210202022121000212201 |
4 | 1111302030202010221 |
5 | 3002120202414004 |
6 | 110152001140201 |
7 | 6440401535302 |
oct | 1256214420451 |
9 | 283668530781 |
10 | 92110201129 |
11 | 36077897471 |
12 | 15a2762a661 |
13 | 88bc0723bb |
14 | 465b2817a9 |
15 | 25e175b6a4 |
hex | 1572322129 |
92110201129 has 2 divisors, whose sum is σ = 92110201130. Its totient is φ = 92110201128.
The previous prime is 92110201049. The next prime is 92110201133.
92110201129 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49886115904 + 42224085225 = 223352^2 + 205485^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 92110201129 - 29 = 92110200617 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 92110201097 and 92110201106.
It is not a weakly prime, because it can be changed into another prime (92110201829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46055100564 + 46055100565.
It is an arithmetic number, because the mean of its divisors is an integer number (46055100565).
Almost surely, 292110201129 is an apocalyptic number.
It is an amenable number.
92110201129 is a deficient number, since it is larger than the sum of its proper divisors (1).
92110201129 is an equidigital number, since it uses as much as digits as its factorization.
92110201129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 92110201129 in words is "ninety-two billion, one hundred ten million, two hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •