Base | Representation |
---|---|
bin | 1000111000100000101… |
… | …1111101000101111100 |
3 | 112120220120011201120022 |
4 | 2032020023331011330 |
5 | 10000020311044211 |
6 | 154035113511312 |
7 | 14011533316040 |
oct | 2161013750574 |
9 | 476816151508 |
10 | 152608690556 |
11 | 597a2699a63 |
12 | 256b0412538 |
13 | 11510b75c3a |
14 | 755a016020 |
15 | 3e82b29bdb |
hex | 23882fd17c |
152608690556 has 12 divisors (see below), whose sum is σ = 305217381168. Its totient is φ = 65403724512.
The previous prime is 152608690537. The next prime is 152608690613. The reversal of 152608690556 is 655096806251.
152608690556 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
152608690556 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 152608690498 and 152608690507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2725155161 + ... + 2725155216.
It is an arithmetic number, because the mean of its divisors is an integer number (25434781764).
Almost surely, 2152608690556 is an apocalyptic number.
It is an amenable number.
152608690556 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152608690556 is a wasteful number, since it uses less digits than its factorization.
152608690556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5450310388 (or 5450310386 counting only the distinct ones).
The product of its (nonzero) digits is 3888000, while the sum is 53.
The spelling of 152608690556 in words is "one hundred fifty-two billion, six hundred eight million, six hundred ninety thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •