Base | Representation |
---|---|
bin | 10010110111001110… |
… | …11100010000110101 |
3 | 222010202201221020101 |
4 | 21123213130100311 |
5 | 131220003010004 |
6 | 4352520434101 |
7 | 505646041114 |
oct | 113347342065 |
9 | 28122657211 |
10 | 10127000629 |
11 | 4327478509 |
12 | 1b67618931 |
13 | c550c5985 |
14 | 6c0d81c7b |
15 | 3e40e7ba4 |
hex | 25b9dc435 |
10127000629 has 2 divisors, whose sum is σ = 10127000630. Its totient is φ = 10127000628.
The previous prime is 10127000617. The next prime is 10127000641. The reversal of 10127000629 is 92600072101.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (10127000617) and next prime (10127000641).
It can be written as a sum of positive squares in only one way, i.e., 10126396900 + 603729 = 100630^2 + 777^2 .
It is a cyclic number.
It is not a de Polignac number, because 10127000629 - 215 = 10126967861 is a prime.
It is a super-2 number, since 2×101270006292 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10127000597 and 10127000606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10127000659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5063500314 + 5063500315.
It is an arithmetic number, because the mean of its divisors is an integer number (5063500315).
Almost surely, 210127000629 is an apocalyptic number.
It is an amenable number.
10127000629 is a deficient number, since it is larger than the sum of its proper divisors (1).
10127000629 is an equidigital number, since it uses as much as digits as its factorization.
10127000629 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 28.
The spelling of 10127000629 in words is "ten billion, one hundred twenty-seven million, six hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •