Base | Representation |
---|---|
bin | 1000111110001110101… |
… | …0110101101000011001 |
3 | 112201212112012210022012 |
4 | 2033203222311220121 |
5 | 10011141214404423 |
6 | 154451302235305 |
7 | 14064551146262 |
oct | 2174352655031 |
9 | 481775183265 |
10 | 154143513113 |
11 | 5a40aaa3957 |
12 | 25a5a425b35 |
13 | 116c6b3b275 |
14 | 7663bc1969 |
15 | 4022752078 |
hex | 23e3ab5a19 |
154143513113 has 2 divisors, whose sum is σ = 154143513114. Its totient is φ = 154143513112.
The previous prime is 154143513089. The next prime is 154143513119. The reversal of 154143513113 is 311315341451.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127926398224 + 26217114889 = 357668^2 + 161917^2 .
It is a cyclic number.
It is not a de Polignac number, because 154143513113 - 26 = 154143513049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 154143513113.
It is not a weakly prime, because it can be changed into another prime (154143513119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77071756556 + 77071756557.
It is an arithmetic number, because the mean of its divisors is an integer number (77071756557).
Almost surely, 2154143513113 is an apocalyptic number.
It is an amenable number.
154143513113 is a deficient number, since it is larger than the sum of its proper divisors (1).
154143513113 is an equidigital number, since it uses as much as digits as its factorization.
154143513113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 10800, while the sum is 32.
Adding to 154143513113 its reverse (311315341451), we get a palindrome (465458854564).
The spelling of 154143513113 in words is "one hundred fifty-four billion, one hundred forty-three million, five hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.682 sec. • engine limits •