Base | Representation |
---|---|
bin | 10010101000000110… |
… | …01100111011010101 |
3 | 221210220212200120221 |
4 | 21110003030323111 |
5 | 130440003410432 |
6 | 4332143554341 |
7 | 502545052135 |
oct | 112403147325 |
9 | 27726780527 |
10 | 10000060117 |
11 | 42718561a3 |
12 | 1b30bbb9b1 |
13 | c34a0b948 |
14 | 6ac17aac5 |
15 | 3d7dc0b97 |
hex | 2540cced5 |
10000060117 has 2 divisors, whose sum is σ = 10000060118. Its totient is φ = 10000060116.
The previous prime is 10000060061. The next prime is 10000060171. The reversal of 10000060117 is 71106000001.
Together with next prime (10000060171) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9784968561 + 215091556 = 98919^2 + 14666^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000060117 is a prime.
It is a super-2 number, since 2×100000601172 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10000060117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000066117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000030058 + 5000030059.
It is an arithmetic number, because the mean of its divisors is an integer number (5000030059).
Almost surely, 210000060117 is an apocalyptic number.
It is an amenable number.
10000060117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000060117 is an equidigital number, since it uses as much as digits as its factorization.
10000060117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42, while the sum is 16.
Adding to 10000060117 its reverse (71106000001), we get a palindrome (81106060118).
The spelling of 10000060117 in words is "ten billion, sixty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •