Base | Representation |
---|---|
bin | 10001000011110011… |
… | …01011110000011101 |
3 | 212122021201101012002 |
4 | 20201321223300131 |
5 | 122224112013112 |
6 | 4112450452045 |
7 | 442650462251 |
oct | 104171536035 |
9 | 25567641162 |
10 | 9158704157 |
11 | 397a938a99 |
12 | 1937294025 |
13 | b2c608c95 |
14 | 62c528261 |
15 | 3890ca1c2 |
hex | 221e6bc1d |
9158704157 has 2 divisors, whose sum is σ = 9158704158. Its totient is φ = 9158704156.
The previous prime is 9158704123. The next prime is 9158704199. The reversal of 9158704157 is 7514078519.
9158704157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8690154841 + 468549316 = 93221^2 + 21646^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9158704157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9158704657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4579352078 + 4579352079.
It is an arithmetic number, because the mean of its divisors is an integer number (4579352079).
Almost surely, 29158704157 is an apocalyptic number.
It is an amenable number.
9158704157 is a deficient number, since it is larger than the sum of its proper divisors (1).
9158704157 is an equidigital number, since it uses as much as digits as its factorization.
9158704157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352800, while the sum is 47.
The square root of 9158704157 is about 95701.1188910558. The cubic root of 9158704157 is about 2092.2392425915.
The spelling of 9158704157 in words is "nine billion, one hundred fifty-eight million, seven hundred four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •