Base | Representation |
---|---|
bin | 1001000100101010001… |
… | …0111100011010001011 |
3 | 112220022210221212001021 |
4 | 2101022202330122023 |
5 | 10023210042400341 |
6 | 155334440133311 |
7 | 14155406602216 |
oct | 2211242743213 |
9 | 486283855037 |
10 | 155869496971 |
11 | 601162a40a1 |
12 | 26260467237 |
13 | 119105b47a6 |
14 | 778910c77d |
15 | 40c40399d1 |
hex | 244a8bc68b |
155869496971 has 2 divisors, whose sum is σ = 155869496972. Its totient is φ = 155869496970.
The previous prime is 155869496957. The next prime is 155869496977. The reversal of 155869496971 is 179694968551.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 155869496971 - 215 = 155869464203 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 155869496971.
It is not a weakly prime, because it can be changed into another prime (155869496977) 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, 77934748485 + 77934748486.
It is an arithmetic number, because the mean of its divisors is an integer number (77934748486).
Almost surely, 2155869496971 is an apocalyptic number.
155869496971 is a deficient number, since it is larger than the sum of its proper divisors (1).
155869496971 is an equidigital number, since it uses as much as digits as its factorization.
155869496971 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 146966400, while the sum is 70.
The spelling of 155869496971 in words is "one hundred fifty-five billion, eight hundred sixty-nine million, four hundred ninety-six thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •