Base | Representation |
---|---|
bin | 1001000100110011101… |
… | …1100000100100001001 |
3 | 112220102121012202110212 |
4 | 2101030323200210021 |
5 | 10023300312202303 |
6 | 155342425250505 |
7 | 14156403543566 |
oct | 2211473404411 |
9 | 486377182425 |
10 | 155909490953 |
11 | 60136930177 |
12 | 26271933a35 |
13 | 11918978678 |
14 | 779055d86d |
15 | 40c77d9ad8 |
hex | 244cee0909 |
155909490953 has 2 divisors, whose sum is σ = 155909490954. Its totient is φ = 155909490952.
The previous prime is 155909490929. The next prime is 155909490973. The reversal of 155909490953 is 359094909551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124272465529 + 31637025424 = 352523^2 + 177868^2 .
It is a cyclic number.
It is not a de Polignac number, because 155909490953 - 28 = 155909490697 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 155909490892 and 155909490901.
It is not a weakly prime, because it can be changed into another prime (155909490973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77954745476 + 77954745477.
It is an arithmetic number, because the mean of its divisors is an integer number (77954745477).
Almost surely, 2155909490953 is an apocalyptic number.
It is an amenable number.
155909490953 is a deficient number, since it is larger than the sum of its proper divisors (1).
155909490953 is an equidigital number, since it uses as much as digits as its factorization.
155909490953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9841500, while the sum is 59.
The spelling of 155909490953 in words is "one hundred fifty-five billion, nine hundred nine million, four hundred ninety thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •