Base | Representation |
---|---|
bin | 10010110111001110… |
… | …11100001111111101 |
3 | 222010202201221011022 |
4 | 21123213130033331 |
5 | 131220003004243 |
6 | 4352520433525 |
7 | 505646041004 |
oct | 113347341775 |
9 | 28122657138 |
10 | 10127000573 |
11 | 4327478468 |
12 | 1b676188a5 |
13 | c550c5941 |
14 | 6c0d81c3b |
15 | 3e40e7b68 |
hex | 25b9dc3fd |
10127000573 has 2 divisors, whose sum is σ = 10127000574. Its totient is φ = 10127000572.
The previous prime is 10127000561. The next prime is 10127000617. The reversal of 10127000573 is 37500072101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7706557369 + 2420443204 = 87787^2 + 49198^2 .
It is an emirp because it is prime and its reverse (37500072101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10127000573 - 222 = 10122806269 is a prime.
It is a super-2 number, since 2×101270005732 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10127000503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5063500286 + 5063500287.
It is an arithmetic number, because the mean of its divisors is an integer number (5063500287).
Almost surely, 210127000573 is an apocalyptic number.
It is an amenable number.
10127000573 is a deficient number, since it is larger than the sum of its proper divisors (1).
10127000573 is an equidigital number, since it uses as much as digits as its factorization.
10127000573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1470, while the sum is 26.
Adding to 10127000573 its reverse (37500072101), we get a palindrome (47627072674).
The spelling of 10127000573 in words is "ten billion, one hundred twenty-seven million, five hundred seventy-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •