Base | Representation |
---|---|
bin | 1001101001100111101000… |
… | …0010001010110011001101 |
3 | 1101120100212010002222100021 |
4 | 2122121322002022303031 |
5 | 2342321020323004442 |
6 | 34322241110102141 |
7 | 2143406654033125 |
oct | 232317202126315 |
9 | 41510763088307 |
10 | 10610616609997 |
11 | 3420a34504868 |
12 | 12344aa04a951 |
13 | 5bc766466181 |
14 | 2897b13a3c85 |
15 | 136016d6ce67 |
hex | 9a67a08accd |
10610616609997 has 2 divisors, whose sum is σ = 10610616609998. Its totient is φ = 10610616609996.
The previous prime is 10610616609977. The next prime is 10610616610001. The reversal of 10610616609997 is 79990661601601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10169376590916 + 441240019081 = 3188946^2 + 664259^2 .
It is an emirp because it is prime and its reverse (79990661601601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10610616609997 - 215 = 10610616577229 is a prime.
It is a super-2 number, since 2×106106166099972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10610616609947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5305308304998 + 5305308304999.
It is an arithmetic number, because the mean of its divisors is an integer number (5305308304999).
Almost surely, 210610616609997 is an apocalyptic number.
It is an amenable number.
10610616609997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10610616609997 is an equidigital number, since it uses as much as digits as its factorization.
10610616609997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6613488, while the sum is 61.
The spelling of 10610616609997 in words is "ten trillion, six hundred ten billion, six hundred sixteen million, six hundred nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •