Base | Representation |
---|---|
bin | 100011011000100110100001… |
… | …111001100000010111111001 |
3 | 202102000100021022022021221002 |
4 | 203120212201321200113321 |
5 | 130344203400124230203 |
6 | 1310551514313454345 |
7 | 44531223555253565 |
oct | 4330464171402771 |
9 | 672010238267832 |
10 | 155622266242553 |
11 | 4564a03a258970 |
12 | 1555477a1113b5 |
13 | 68ab16961b116 |
14 | 2a6022d2d06a5 |
15 | 12ed15b68dd88 |
hex | 8d89a1e605f9 |
155622266242553 has 16 divisors (see below), whose sum is σ = 172684091522880. Its totient is φ = 139066319928000.
The previous prime is 155622266242549. The next prime is 155622266242559. The reversal of 155622266242553 is 355242662226551.
It is a cyclic number.
It is not a de Polignac number, because 155622266242553 - 22 = 155622266242549 is a prime.
It is a super-3 number, since 3×1556222662425533 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (155622266242559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 503709050 + ... + 504017907.
It is an arithmetic number, because the mean of its divisors is an integer number (10792755720180).
Almost surely, 2155622266242553 is an apocalyptic number.
It is an amenable number.
155622266242553 is a deficient number, since it is larger than the sum of its proper divisors (17061825280327).
155622266242553 is a wasteful number, since it uses less digits than its factorization.
155622266242553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007727208.
The product of its digits is 51840000, while the sum is 56.
The spelling of 155622266242553 in words is "one hundred fifty-five trillion, six hundred twenty-two billion, two hundred sixty-six million, two hundred forty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •