Base | Representation |
---|---|
bin | 1001000001100011100… |
… | …1110111000001010101 |
3 | 112211011202210111202012 |
4 | 2100120321313001111 |
5 | 10020003340042123 |
6 | 155120045154005 |
7 | 14125644503561 |
oct | 2203071670125 |
9 | 484152714665 |
10 | 155036643413 |
11 | 5a829163973 |
12 | 2606955b905 |
13 | 11809b9ab32 |
14 | 770a6706a1 |
15 | 4075d73378 |
hex | 2418e77055 |
155036643413 has 2 divisors, whose sum is σ = 155036643414. Its totient is φ = 155036643412.
The previous prime is 155036643343. The next prime is 155036643449. The reversal of 155036643413 is 314346630551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125094493969 + 29942149444 = 353687^2 + 173038^2 .
It is a cyclic number.
It is not a de Polignac number, because 155036643413 - 220 = 155035594837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155036603413) 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, 77518321706 + 77518321707.
It is an arithmetic number, because the mean of its divisors is an integer number (77518321707).
Almost surely, 2155036643413 is an apocalyptic number.
It is an amenable number.
155036643413 is a deficient number, since it is larger than the sum of its proper divisors (1).
155036643413 is an equidigital number, since it uses as much as digits as its factorization.
155036643413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 41.
The spelling of 155036643413 in words is "one hundred fifty-five billion, thirty-six million, six hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •