Base | Representation |
---|---|
bin | 10111000000111100110000… |
… | …001001101001111001100001 |
3 | 111021101120021220000021201001 |
4 | 113000330300021221321201 |
5 | 101231343134314231423 |
6 | 555135544223512001 |
7 | 30214632305645335 |
oct | 2700746011517141 |
9 | 437346256007631 |
10 | 101220302102113 |
11 | 2a28531a802057 |
12 | b42920a458601 |
13 | 446305889110c |
14 | 1add1357c17c5 |
15 | ba7e8b9eccad |
hex | 5c0f30269e61 |
101220302102113 has 2 divisors, whose sum is σ = 101220302102114. Its totient is φ = 101220302102112.
The previous prime is 101220302102111. The next prime is 101220302102119. The reversal of 101220302102113 is 311201203022101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70682222481984 + 30538079620129 = 8407272^2 + 5526127^2 .
It is a cyclic number.
It is not a de Polignac number, because 101220302102113 - 21 = 101220302102111 is a prime.
Together with 101220302102111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101220302102111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610151051056 + 50610151051057.
It is an arithmetic number, because the mean of its divisors is an integer number (50610151051057).
Almost surely, 2101220302102113 is an apocalyptic number.
It is an amenable number.
101220302102113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101220302102113 is an equidigital number, since it uses as much as digits as its factorization.
101220302102113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 101220302102113 its reverse (311201203022101), we get a palindrome (412421505124214).
The spelling of 101220302102113 in words is "one hundred one trillion, two hundred twenty billion, three hundred two million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •