Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …101010110110110100111101 |
3 | 111010001220112022221122012201 |
4 | 112233030101222312310331 |
5 | 101101400020110000221 |
6 | 552403212555231501 |
7 | 30030522501141406 |
oct | 2657142152666475 |
9 | 433056468848181 |
10 | 100000020000061 |
11 | 29954852327555 |
12 | b270810448591 |
13 | 43a4c663293bc |
14 | 1a9a05373a9ad |
15 | b8636b420891 |
hex | 5af311ab6d3d |
100000020000061 has 2 divisors, whose sum is σ = 100000020000062. Its totient is φ = 100000020000060.
The previous prime is 100000020000019. The next prime is 100000020000103. The reversal of 100000020000061 is 160000020000001.
It is a balanced prime because it is at equal distance from previous prime (100000020000019) and next prime (100000020000103).
It can be written as a sum of positive squares in only one way, i.e., 90797934152025 + 9202085848036 = 9528795^2 + 3033494^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000020000061 - 29 = 100000019999549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100000020010061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000010000030 + 50000010000031.
It is an arithmetic number, because the mean of its divisors is an integer number (50000010000031).
Almost surely, 2100000020000061 is an apocalyptic number.
It is an amenable number.
100000020000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000020000061 is an equidigital number, since it uses as much as digits as its factorization.
100000020000061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 100000020000061 its reverse (160000020000001), we get a palindrome (260000040000062).
The spelling of 100000020000061 in words is "one hundred trillion, twenty million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •