Base | Representation |
---|---|
bin | 1000010111100100011101… |
… | …1111001000100111100011 |
3 | 1012120121102212001220210011 |
4 | 2011321013133020213203 |
5 | 2201222141414322011 |
6 | 31322520115345351 |
7 | 1636515556363402 |
oct | 205710737104743 |
9 | 35517385056704 |
10 | 9201019292131 |
11 | 2a2814857a617 |
12 | 10472768b2257 |
13 | 5198634121b4 |
14 | 23b4902d7639 |
15 | 10e516393621 |
hex | 85e477c89e3 |
9201019292131 has 2 divisors, whose sum is σ = 9201019292132. Its totient is φ = 9201019292130.
The previous prime is 9201019291979. The next prime is 9201019292137. The reversal of 9201019292131 is 1312929101029.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 9201019292131 - 29 = 9201019291619 is a prime.
It is a super-2 number, since 2×92010192921312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (9201019292137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4600509646065 + 4600509646066.
It is an arithmetic number, because the mean of its divisors is an integer number (4600509646066).
Almost surely, 29201019292131 is an apocalyptic number.
9201019292131 is a deficient number, since it is larger than the sum of its proper divisors (1).
9201019292131 is an equidigital number, since it uses as much as digits as its factorization.
9201019292131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 40.
The spelling of 9201019292131 in words is "nine trillion, two hundred one billion, nineteen million, two hundred ninety-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •