Base | Representation |
---|---|
bin | 1000110110101101100… |
… | …0111001001001100011 |
3 | 112112122220001021201210 |
4 | 2031223120321021203 |
5 | 4443023114334021 |
6 | 153515134201203 |
7 | 13663545531441 |
oct | 2155330711143 |
9 | 475586037653 |
10 | 152125543011 |
11 | 595749a3072 |
12 | 25596653203 |
13 | 11464a41710 |
14 | 7511ba9b91 |
15 | 3e554dee76 |
hex | 236b639263 |
152125543011 has 32 divisors (see below), whose sum is σ = 225621114880. Its totient is φ = 90540374400.
The previous prime is 152125542929. The next prime is 152125543019. The reversal of 152125543011 is 110345521251.
152125543011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 152125543011 - 213 = 152125534819 is a prime.
It is a super-2 number, since 2×1521255430112 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 152125543011.
It is not an unprimeable number, because it can be changed into a prime (152125543019) 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 31 ways as a sum of consecutive naturals, for example, 1980126 + ... + 2055516.
It is an arithmetic number, because the mean of its divisors is an integer number (7050659840).
Almost surely, 2152125543011 is an apocalyptic number.
152125543011 is a deficient number, since it is larger than the sum of its proper divisors (73495571869).
152125543011 is a wasteful number, since it uses less digits than its factorization.
152125543011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77107.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 152125543011 in words is "one hundred fifty-two billion, one hundred twenty-five million, five hundred forty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •