Base | Representation |
---|---|
bin | 10110101000010110100… |
… | …011110111001110100100 |
3 | 12111200010112121211121122 |
4 | 112220112203313032210 |
5 | 200434430101124111 |
6 | 3150232404233112 |
7 | 220233142340600 |
oct | 26502643671644 |
9 | 5450115554548 |
10 | 1555156661156 |
11 | 54a5a143527a |
12 | 21149699b798 |
13 | b385c606a07 |
14 | 553acb9c500 |
15 | 2a6be7ddcdb |
hex | 16a168f73a4 |
1555156661156 has 72 divisors (see below), whose sum is σ = 3295116155520. Its totient is φ = 639564787008.
The previous prime is 1555156661119. The next prime is 1555156661159. The reversal of 1555156661156 is 6511666515551.
It is a junction number, because it is equal to n+sod(n) for n = 1555156661098 and 1555156661107.
It is not an unprimeable number, because it can be changed into a prime (1555156661159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87221 + ... + 1765763.
It is an arithmetic number, because the mean of its divisors is an integer number (45765502160).
Almost surely, 21555156661156 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1555156661156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1647558077760).
1555156661156 is an abundant number, since it is smaller than the sum of its proper divisors (1739959494364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1555156661156 is a wasteful number, since it uses less digits than its factorization.
1555156661156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678753 (or 1678744 counting only the distinct ones).
The product of its digits is 4050000, while the sum is 53.
The spelling of 1555156661156 in words is "one trillion, five hundred fifty-five billion, one hundred fifty-six million, six hundred sixty-one thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •