Base | Representation |
---|---|
bin | 1001000010010111101… |
… | …1110101010101110101 |
3 | 112211202000011121200021 |
4 | 2100211323311111311 |
5 | 10020430321432004 |
6 | 155153455045141 |
7 | 14134240655323 |
oct | 2204573652565 |
9 | 484660147607 |
10 | 155255264629 |
11 | 5a930605263 |
12 | 2610a8107b1 |
13 | 11843274aba |
14 | 772b6dcd13 |
15 | 408a159d54 |
hex | 2425ef5575 |
155255264629 has 2 divisors, whose sum is σ = 155255264630. Its totient is φ = 155255264628.
The previous prime is 155255264587. The next prime is 155255264657. The reversal of 155255264629 is 926462552551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126399447729 + 28855816900 = 355527^2 + 169870^2 .
It is a cyclic number.
It is not a de Polignac number, because 155255264629 - 219 = 155254740341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155255264669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77627632314 + 77627632315.
It is an arithmetic number, because the mean of its divisors is an integer number (77627632315).
Almost surely, 2155255264629 is an apocalyptic number.
It is an amenable number.
155255264629 is a deficient number, since it is larger than the sum of its proper divisors (1).
155255264629 is an equidigital number, since it uses as much as digits as its factorization.
155255264629 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480000, while the sum is 52.
The spelling of 155255264629 in words is "one hundred fifty-five billion, two hundred fifty-five million, two hundred sixty-four thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •