Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110100100000101001101 |
3 | 111020121121020100102201200102 |
4 | 112331300200232210011031 |
5 | 101214300022000310221 |
6 | 554451115134540445 |
7 | 30163036635633434 |
oct | 2675604056440515 |
9 | 436547210381612 |
10 | 101001000010061 |
11 | 2a200313462468 |
12 | b3b2806667725 |
13 | 44484796533c8 |
14 | 1ad268ddaa11b |
15 | ba2403c1a30b |
hex | 5bdc20ba414d |
101001000010061 has 2 divisors, whose sum is σ = 101001000010062. Its totient is φ = 101001000010060.
The previous prime is 101001000010003. The next prime is 101001000010091. The reversal of 101001000010061 is 160010000100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84570186402025 + 16430813608036 = 9196205^2 + 4053494^2 .
It is an emirp because it is prime and its reverse (160010000100101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101001000010061 - 218 = 101000999747917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001000010091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500500005030 + 50500500005031.
It is an arithmetic number, because the mean of its divisors is an integer number (50500500005031).
Almost surely, 2101001000010061 is an apocalyptic number.
It is an amenable number.
101001000010061 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001000010061 is an equidigital number, since it uses as much as digits as its factorization.
101001000010061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 101001000010061 its reverse (160010000100101), we get a palindrome (261011000110162).
The spelling of 101001000010061 in words is "one hundred one trillion, one billion, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •