Base | Representation |
---|---|
bin | 1000111000010100000… |
… | …1011111001110011101 |
3 | 112120202212022012202220 |
4 | 2032011001133032131 |
5 | 4444413214141013 |
6 | 154025540135553 |
7 | 14010320222145 |
oct | 2160501371635 |
9 | 476685265686 |
10 | 152555615133 |
11 | 59775738679 |
12 | 256966975b9 |
13 | 11502b81a6c |
14 | 7552d5b925 |
15 | 3e7d143b23 |
hex | 238505f39d |
152555615133 has 16 divisors (see below), whose sum is σ = 203941483200. Its totient is φ = 101436926976.
The previous prime is 152555615039. The next prime is 152555615141. The reversal of 152555615133 is 331516555251.
152555615133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-152555615133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152555615033) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3584766 + ... + 3627072.
It is an arithmetic number, because the mean of its divisors is an integer number (12746342700).
Almost surely, 2152555615133 is an apocalyptic number.
It is an amenable number.
152555615133 is a deficient number, since it is larger than the sum of its proper divisors (51385868067).
152555615133 is a wasteful number, since it uses less digits than its factorization.
152555615133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45436.
The product of its digits is 337500, while the sum is 42.
The spelling of 152555615133 in words is "one hundred fifty-two billion, five hundred fifty-five million, six hundred fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •