Base | Representation |
---|---|
bin | 10010111010111100… |
… | …01001110011011101 |
3 | 222012221021222012111 |
4 | 21131132021303131 |
5 | 131300434321112 |
6 | 4355551434021 |
7 | 506504411443 |
oct | 113536116335 |
9 | 28187258174 |
10 | 10158120157 |
11 | 4342aa3029 |
12 | 1b75b25911 |
13 | c5b6a03b3 |
14 | 6c5162b93 |
15 | 3e6be35a7 |
hex | 25d789cdd |
10158120157 has 6 divisors (see below), whose sum is σ = 10720897278. Its totient is φ = 9623481912.
The previous prime is 10158120127. The next prime is 10158120187. The reversal of 10158120157 is 75102185101.
It is an interprime number because it is at equal distance from previous prime (10158120127) and next prime (10158120187).
It can be written as a sum of positive squares in only one way, i.e., 10041242436 + 116877721 = 100206^2 + 10811^2 .
It is not a de Polignac number, because 10158120157 - 231 = 8010636509 is a prime.
It is the 100788-th Hogben number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10158120127) by changing a digit.
It is a nontrivial repunit in base 100787.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14069058 + ... + 14069779.
It is an arithmetic number, because the mean of its divisors is an integer number (1786816213).
Almost surely, 210158120157 is an apocalyptic number.
It is an amenable number.
10158120157 is a deficient number, since it is larger than the sum of its proper divisors (562777121).
10158120157 is an equidigital number, since it uses as much as digits as its factorization.
10158120157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28138875 (or 28138856 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 31.
The spelling of 10158120157 in words is "ten billion, one hundred fifty-eight million, one hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •