Base | Representation |
---|---|
bin | 10100111010110100011111… |
… | …111111101000011101010101 |
3 | 110001202101220102201011102122 |
4 | 110322310133333220131111 |
5 | 44024334201443101401 |
6 | 523401335320145325 |
7 | 25243666611114146 |
oct | 2472643777503525 |
9 | 401671812634378 |
10 | 92003031222101 |
11 | 273512a2679a7a |
12 | a39a979008245 |
13 | 3c44b0554863c |
14 | 18a0d82d85acd |
15 | a98323a1921b |
hex | 53ad1ffe8755 |
92003031222101 has 2 divisors, whose sum is σ = 92003031222102. Its totient is φ = 92003031222100.
The previous prime is 92003031222061. The next prime is 92003031222119. The reversal of 92003031222101 is 10122213030029.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91900790520100 + 102240702001 = 9586490^2 + 319751^2 .
It is an emirp because it is prime and its reverse (10122213030029) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 92003031222101 - 234 = 91985851352917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (92003031222121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 46001515611050 + 46001515611051.
It is an arithmetic number, because the mean of its divisors is an integer number (46001515611051).
Almost surely, 292003031222101 is an apocalyptic number.
It is an amenable number.
92003031222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
92003031222101 is an equidigital number, since it uses as much as digits as its factorization.
92003031222101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 92003031222101 in words is "ninety-two trillion, three billion, thirty-one million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •