Base | Representation |
---|---|
bin | 10010111100011110… |
… | …00000111111110001 |
3 | 222020211101201211011 |
4 | 21132033000333301 |
5 | 131312224213022 |
6 | 4401130150521 |
7 | 510021320425 |
oct | 113617007761 |
9 | 28224351734 |
10 | 10170929137 |
11 | 434a251666 |
12 | 1b7a282441 |
13 | c61236685 |
14 | 6c6b38b85 |
15 | 3e7dc3977 |
hex | 25e3c0ff1 |
10170929137 has 2 divisors, whose sum is σ = 10170929138. Its totient is φ = 10170929136.
The previous prime is 10170929051. The next prime is 10170929141. The reversal of 10170929137 is 73192907101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9269068176 + 901860961 = 96276^2 + 30031^2 .
It is a cyclic number.
It is not a de Polignac number, because 10170929137 - 211 = 10170927089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10170929137.
It is not a weakly prime, because it can be changed into another prime (10170929147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5085464568 + 5085464569.
It is an arithmetic number, because the mean of its divisors is an integer number (5085464569).
Almost surely, 210170929137 is an apocalyptic number.
It is an amenable number.
10170929137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10170929137 is an equidigital number, since it uses as much as digits as its factorization.
10170929137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23814, while the sum is 40.
The spelling of 10170929137 in words is "ten billion, one hundred seventy million, nine hundred twenty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •