Base | Representation |
---|---|
bin | 10111000010100011110110… |
… | …110111100010100110000111 |
3 | 111021210011001022211110111112 |
4 | 113002203312313202212013 |
5 | 101240201402102430431 |
6 | 555302453510355235 |
7 | 30225631616164043 |
oct | 2702436667424607 |
9 | 437704038743445 |
10 | 101331010201991 |
11 | 2a318270624079 |
12 | b44676635bb1b |
13 | 447061c9a511b |
14 | 1b04638a4b023 |
15 | baacbad67c2b |
hex | 5c28f6de2987 |
101331010201991 has 2 divisors, whose sum is σ = 101331010201992. Its totient is φ = 101331010201990.
The previous prime is 101331010201969. The next prime is 101331010202029. The reversal of 101331010201991 is 199102010133101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101331010201991 - 210 = 101331010200967 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101331010201901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665505100995 + 50665505100996.
It is an arithmetic number, because the mean of its divisors is an integer number (50665505100996).
Almost surely, 2101331010201991 is an apocalyptic number.
101331010201991 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331010201991 is an equidigital number, since it uses as much as digits as its factorization.
101331010201991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 101331010201991 in words is "one hundred one trillion, three hundred thirty-one billion, ten million, two hundred one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •