Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …010100100001110111000001 |
3 | 111021022211001110021111002211 |
4 | 113000223231110201313001 |
5 | 101231043144224310423 |
6 | 555123320223542121 |
7 | 30213413633145103 |
oct | 2700535524416701 |
9 | 437284043244084 |
10 | 101202001010113 |
11 | 2a27858926a833 |
12 | b42576145a941 |
13 | 446140016c9b3 |
14 | 1adc2badb9573 |
15 | ba7769ebc10d |
hex | 5c0aed521dc1 |
101202001010113 has 2 divisors, whose sum is σ = 101202001010114. Its totient is φ = 101202001010112.
The previous prime is 101202001010057. The next prime is 101202001010197. The reversal of 101202001010113 is 311010100202101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73043568181809 + 28158432828304 = 8546553^2 + 5306452^2 .
It is a cyclic number.
It is not a de Polignac number, because 101202001010113 - 29 = 101202001009601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101202001010093 and 101202001010102.
It is not a weakly prime, because it can be changed into another prime (101202001010413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50601000505056 + 50601000505057.
It is an arithmetic number, because the mean of its divisors is an integer number (50601000505057).
Almost surely, 2101202001010113 is an apocalyptic number.
It is an amenable number.
101202001010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101202001010113 is an equidigital number, since it uses as much as digits as its factorization.
101202001010113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101202001010113 its reverse (311010100202101), we get a palindrome (412212101212214).
The spelling of 101202001010113 in words is "one hundred one trillion, two hundred two billion, one million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •