Base | Representation |
---|---|
bin | 1001010010000110101010… |
… | …1000100010010101101001 |
3 | 1100010202002200111012211222 |
4 | 2110201222220202111221 |
5 | 2314211140103302401 |
6 | 33412510043031425 |
7 | 2102255560435562 |
oct | 224415250422551 |
9 | 40122080435758 |
10 | 10206631306601 |
11 | 3285676316aa4 |
12 | 118a14420b575 |
13 | 590634280952 |
14 | 274009bd5169 |
15 | 12a770653c1b |
hex | 9486aa22569 |
10206631306601 has 2 divisors, whose sum is σ = 10206631306602. Its totient is φ = 10206631306600.
The previous prime is 10206631306589. The next prime is 10206631306609. The reversal of 10206631306601 is 10660313660201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7528904893225 + 2677726413376 = 2743885^2 + 1636376^2 .
It is an emirp because it is prime and its reverse (10660313660201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10206631306601 - 226 = 10206564197737 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10206631306609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5103315653300 + 5103315653301.
It is an arithmetic number, because the mean of its divisors is an integer number (5103315653301).
Almost surely, 210206631306601 is an apocalyptic number.
It is an amenable number.
10206631306601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10206631306601 is an equidigital number, since it uses as much as digits as its factorization.
10206631306601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 35.
Adding to 10206631306601 its reverse (10660313660201), we get a palindrome (20866944966802).
The spelling of 10206631306601 in words is "ten trillion, two hundred six billion, six hundred thirty-one million, three hundred six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •