Base | Representation |
---|---|
bin | 1001001111111101111… |
… | …0010010110100001001 |
3 | 120012011100201001110011 |
4 | 2103333132102310021 |
5 | 10100414132012441 |
6 | 200555552351521 |
7 | 14323545552424 |
oct | 2237736226411 |
9 | 505140631404 |
10 | 158904954121 |
11 | 61433781a71 |
12 | 26968b455a1 |
13 | 11ca5431b94 |
14 | 79963049bb |
15 | 4200784581 |
hex | 24ff792d09 |
158904954121 has 2 divisors, whose sum is σ = 158904954122. Its totient is φ = 158904954120.
The previous prime is 158904954101. The next prime is 158904954157. The reversal of 158904954121 is 121459409851.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97406410000 + 61498544121 = 312100^2 + 247989^2 .
It is a cyclic number.
It is not a de Polignac number, because 158904954121 - 27 = 158904953993 is a prime.
It is a super-2 number, since 2×1589049541212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (158904954101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79452477060 + 79452477061.
It is an arithmetic number, because the mean of its divisors is an integer number (79452477061).
Almost surely, 2158904954121 is an apocalyptic number.
It is an amenable number.
158904954121 is a deficient number, since it is larger than the sum of its proper divisors (1).
158904954121 is an equidigital number, since it uses as much as digits as its factorization.
158904954121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 49.
It can be divided in two parts, 158904 and 954121, that added together give a square (1113025 = 10552).
The spelling of 158904954121 in words is "one hundred fifty-eight billion, nine hundred four million, nine hundred fifty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •