Base | Representation |
---|---|
bin | 10111000000101010110001… |
… | …110001101011110100101001 |
3 | 111021022201110211111112111002 |
4 | 113000222301301223310221 |
5 | 101231034123004121022 |
6 | 555123033140044345 |
7 | 30213350112651635 |
oct | 2700526161536451 |
9 | 437281424445432 |
10 | 101201002020137 |
11 | 2a278116376888 |
12 | b4255229936b5 |
13 | 44612a11c7476 |
14 | 1adc224451dc5 |
15 | ba770c43a092 |
hex | 5c0ab1c6bd29 |
101201002020137 has 2 divisors, whose sum is σ = 101201002020138. Its totient is φ = 101201002020136.
The previous prime is 101201002020073. The next prime is 101201002020193. The reversal of 101201002020137 is 731020200102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98589429666841 + 2611572353296 = 9929221^2 + 1616036^2 .
It is a cyclic number.
It is not a de Polignac number, because 101201002020137 - 26 = 101201002020073 is a prime.
It is not a weakly prime, because it can be changed into another prime (101201002020197) 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, 50600501010068 + 50600501010069.
It is an arithmetic number, because the mean of its divisors is an integer number (50600501010069).
Almost surely, 2101201002020137 is an apocalyptic number.
It is an amenable number.
101201002020137 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201002020137 is an equidigital number, since it uses as much as digits as its factorization.
101201002020137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 101201002020137 its reverse (731020200102101), we get a palindrome (832221202122238).
The spelling of 101201002020137 in words is "one hundred one trillion, two hundred one billion, two million, twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •