Base | Representation |
---|---|
bin | 10011101111101111… |
… | …00100000101001001 |
3 | 1000100210122001001021 |
4 | 21313313210011021 |
5 | 133202323122001 |
6 | 4511531552441 |
7 | 523462630321 |
oct | 116767440511 |
9 | 30323561037 |
10 | 10600989001 |
11 | 454aa88a39 |
12 | 207a2bb721 |
13 | ccc371275 |
14 | 727cc6281 |
15 | 420a23ba1 |
hex | 277de4149 |
10600989001 has 2 divisors, whose sum is σ = 10600989002. Its totient is φ = 10600989000.
The previous prime is 10600988999. The next prime is 10600989037. The reversal of 10600989001 is 10098900601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7691465401 + 2909523600 = 87701^2 + 53940^2 .
It is an emirp because it is prime and its reverse (10098900601) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 10068600901 and 10900686001.
It is a cyclic number.
It is not a de Polignac number, because 10600989001 - 21 = 10600988999 is a prime.
It is a super-2 number, since 2×106009890012 (a number of 21 digits) contains 22 as substring.
Together with 10600988999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10600989071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5300494500 + 5300494501.
It is an arithmetic number, because the mean of its divisors is an integer number (5300494501).
Almost surely, 210600989001 is an apocalyptic number.
It is an amenable number.
10600989001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10600989001 is an equidigital number, since it uses as much as digits as its factorization.
10600989001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 34.
The spelling of 10600989001 in words is "ten billion, six hundred million, nine hundred eighty-nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •