Base | Representation |
---|---|
bin | 10010111010110111… |
… | …01011010110011011 |
3 | 222012220001222220111 |
4 | 21131123223112123 |
5 | 131300303034011 |
6 | 4355525505151 |
7 | 506466036313 |
oct | 113533532633 |
9 | 28186058814 |
10 | 10157471131 |
11 | 434269a445 |
12 | 1b758721b7 |
13 | c5b503b62 |
14 | 6c5034443 |
15 | 3e6b16121 |
hex | 25d6eb59b |
10157471131 has 2 divisors, whose sum is σ = 10157471132. Its totient is φ = 10157471130.
The previous prime is 10157471089. The next prime is 10157471143. The reversal of 10157471131 is 13117475101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10157471131 - 219 = 10156946843 is a prime.
It is a super-2 number, since 2×101574711312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10157471093 and 10157471102.
It is not a weakly prime, because it can be changed into another prime (10157471161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5078735565 + 5078735566.
It is an arithmetic number, because the mean of its divisors is an integer number (5078735566).
Almost surely, 210157471131 is an apocalyptic number.
10157471131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10157471131 is an equidigital number, since it uses as much as digits as its factorization.
10157471131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940, while the sum is 31.
The spelling of 10157471131 in words is "ten billion, one hundred fifty-seven million, four hundred seventy-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •