Base | Representation |
---|---|
bin | 1001000011111010010… |
… | …1100110010111111100 |
3 | 112212210211102202212011 |
4 | 2100332211212113330 |
5 | 10022302212212211 |
6 | 155302512021004 |
7 | 14150422351000 |
oct | 2207645462774 |
9 | 485724382764 |
10 | 155668866556 |
11 | 60023020535 |
12 | 26205231764 |
13 | 118aab69578 |
14 | 776a604700 |
15 | 40b1608921 |
hex | 243e9665fc |
155668866556 has 48 divisors (see below), whose sum is σ = 317880774400. Its totient is φ = 66675495600.
The previous prime is 155668866511. The next prime is 155668866599. The reversal of 155668866556 is 655668866551.
It is a happy number.
It is a super-3 number, since 3×1556688665563 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 155668866491 and 155668866500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2331031 + ... + 2396881.
Almost surely, 2155668866556 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 155668866556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158940387200).
155668866556 is an abundant number, since it is smaller than the sum of its proper divisors (162211907844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155668866556 is a wasteful number, since it uses less digits than its factorization.
155668866556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67599 (or 67583 counting only the distinct ones).
The product of its digits is 311040000, while the sum is 67.
The spelling of 155668866556 in words is "one hundred fifty-five billion, six hundred sixty-eight million, eight hundred sixty-six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •