Base | Representation |
---|---|
bin | 10010110111011110… |
… | …11110110000011101 |
3 | 222010220201000000001 |
4 | 21123233132300131 |
5 | 131221022423442 |
6 | 4353033534301 |
7 | 506002666051 |
oct | 113357366035 |
9 | 28126630001 |
10 | 10129107997 |
11 | 4328687838 |
12 | 1b68274391 |
13 | c55682c38 |
14 | 6c136dc61 |
15 | 3e43b22b7 |
hex | 25bbdec1d |
10129107997 has 2 divisors, whose sum is σ = 10129107998. Its totient is φ = 10129107996.
The previous prime is 10129107979. The next prime is 10129108037. The reversal of 10129107997 is 79970192101.
Together with previous prime (10129107979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6198570361 + 3930537636 = 78731^2 + 62694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10129107997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10129107497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5064553998 + 5064553999.
It is an arithmetic number, because the mean of its divisors is an integer number (5064553999).
Almost surely, 210129107997 is an apocalyptic number.
It is an amenable number.
10129107997 is a deficient number, since it is larger than the sum of its proper divisors (1).
10129107997 is an equidigital number, since it uses as much as digits as its factorization.
10129107997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 71442, while the sum is 46.
The spelling of 10129107997 in words is "ten billion, one hundred twenty-nine million, one hundred seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •