Base | Representation |
---|---|
bin | 10010101000001101… |
… | …10101000100110101 |
3 | 221210222122222221201 |
4 | 21110012311010311 |
5 | 130440224322442 |
6 | 4332220212501 |
7 | 502556122315 |
oct | 112406650465 |
9 | 27728588851 |
10 | 10001010997 |
11 | 427234564a |
12 | 1b3139a131 |
13 | c34c826b3 |
14 | 6ac347445 |
15 | 3d800c7b7 |
hex | 2541b5135 |
10001010997 has 2 divisors, whose sum is σ = 10001010998. Its totient is φ = 10001010996.
The previous prime is 10001010989. The next prime is 10001011001. The reversal of 10001010997 is 79901010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5447325636 + 4553685361 = 73806^2 + 67481^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001010997 - 23 = 10001010989 is a prime.
It is a super-2 number, since 2×100010109972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001010917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000505498 + 5000505499.
It is an arithmetic number, because the mean of its divisors is an integer number (5000505499).
Almost surely, 210001010997 is an apocalyptic number.
It is an amenable number.
10001010997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001010997 is an equidigital number, since it uses as much as digits as its factorization.
10001010997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 28.
Adding to 10001010997 its reverse (79901010001), we get a palindrome (89902020998).
The spelling of 10001010997 in words is "ten billion, one million, ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •