Base | Representation |
---|---|
bin | 101010110101110110… |
… | …0010110000110101001 |
3 | 22210110201022010112121 |
4 | 1111223230112012221 |
5 | 3001404240201301 |
6 | 110133102511241 |
7 | 6434605306633 |
oct | 1255354260651 |
9 | 283421263477 |
10 | 92001100201 |
11 | 3602124a30a |
12 | 159b6b95521 |
13 | 88a259333a |
14 | 464a9a1a53 |
15 | 25d6daa3a1 |
hex | 156bb161a9 |
92001100201 has 2 divisors, whose sum is σ = 92001100202. Its totient is φ = 92001100200.
The previous prime is 92001100117. The next prime is 92001100207. The reversal of 92001100201 is 10200110029.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91823544576 + 177555625 = 303024^2 + 13325^2 .
It is a cyclic number.
It is not a de Polignac number, because 92001100201 - 217 = 92000969129 is a prime.
It is not a weakly prime, because it can be changed into another prime (92001100207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46000550100 + 46000550101.
It is an arithmetic number, because the mean of its divisors is an integer number (46000550101).
Almost surely, 292001100201 is an apocalyptic number.
It is an amenable number.
92001100201 is a deficient number, since it is larger than the sum of its proper divisors (1).
92001100201 is an equidigital number, since it uses as much as digits as its factorization.
92001100201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 92001100201 in words is "ninety-two billion, one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •