Base | Representation |
---|---|
bin | 1001001101101001100100… |
… | …0101001111010101010001 |
3 | 1022212102120011112112201011 |
4 | 2103122121011033111101 |
5 | 2311432421344442122 |
6 | 33313412040410521 |
7 | 2063606231143354 |
oct | 223323105172521 |
9 | 38772504475634 |
10 | 10130101171537 |
11 | 3256174024896 |
12 | 1177346476a41 |
13 | 586358c93b69 |
14 | 270429c1229b |
15 | 128791add377 |
hex | 9369914f551 |
10130101171537 has 2 divisors, whose sum is σ = 10130101171538. Its totient is φ = 10130101171536.
The previous prime is 10130101171457. The next prime is 10130101171649. The reversal of 10130101171537 is 73517110103101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10118449264401 + 11651907136 = 3180951^2 + 107944^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130101171537 - 215 = 10130101138769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10130101171499 and 10130101171508.
It is not a weakly prime, because it can be changed into another prime (10130101171837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065050585768 + 5065050585769.
It is an arithmetic number, because the mean of its divisors is an integer number (5065050585769).
Almost surely, 210130101171537 is an apocalyptic number.
It is an amenable number.
10130101171537 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130101171537 is an equidigital number, since it uses as much as digits as its factorization.
10130101171537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2205, while the sum is 31.
Adding to 10130101171537 its reverse (73517110103101), we get a palindrome (83647211274638).
The spelling of 10130101171537 in words is "ten trillion, one hundred thirty billion, one hundred one million, one hundred seventy-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •