Base | Representation |
---|---|
bin | 1001001110101010000… |
… | …1010000110111010111 |
3 | 120011020212012210222201 |
4 | 2103222201100313113 |
5 | 10044204133123111 |
6 | 200501033505331 |
7 | 14312046520441 |
oct | 2235241206727 |
9 | 504225183881 |
10 | 158553411031 |
11 | 612732a3494 |
12 | 2688b272247 |
13 | 11c4a658512 |
14 | 7961755491 |
15 | 41ce9936c1 |
hex | 24ea850dd7 |
158553411031 has 2 divisors, whose sum is σ = 158553411032. Its totient is φ = 158553411030.
The previous prime is 158553411017. The next prime is 158553411073. The reversal of 158553411031 is 130114355851.
158553411031 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 is a cyclic number.
It is not a de Polignac number, because 158553411031 - 235 = 124193672663 is a prime.
It is a super-2 number, since 2×1585534110312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (158553411091) 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, 79276705515 + 79276705516.
It is an arithmetic number, because the mean of its divisors is an integer number (79276705516).
Almost surely, 2158553411031 is an apocalyptic number.
158553411031 is a deficient number, since it is larger than the sum of its proper divisors (1).
158553411031 is an equidigital number, since it uses as much as digits as its factorization.
158553411031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 37.
Adding to 158553411031 its reverse (130114355851), we get a palindrome (288667766882).
The spelling of 158553411031 in words is "one hundred fifty-eight billion, five hundred fifty-three million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •