Base | Representation |
---|---|
bin | 1000110111011000011… |
… | …1000010101001111100 |
3 | 112120010102111121121022 |
4 | 2031312013002221330 |
5 | 4443410141201412 |
6 | 153545041323312 |
7 | 14001161435114 |
oct | 2156607025174 |
9 | 476112447538 |
10 | 152305412732 |
11 | 59657486930 |
12 | 25626936538 |
13 | 1149309b1c5 |
14 | 752ba2c044 |
15 | 3e661bea72 |
hex | 23761c2a7c |
152305412732 has 24 divisors (see below), whose sum is σ = 291347616000. Its totient is φ = 69090986160.
The previous prime is 152305412719. The next prime is 152305412737. The reversal of 152305412732 is 237214503251.
152305412732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 152305412692 and 152305412701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152305412737) 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 7 ways as a sum of consecutive naturals, for example, 3446468 + ... + 3490379.
It is an arithmetic number, because the mean of its divisors is an integer number (12139484000).
Almost surely, 2152305412732 is an apocalyptic number.
It is an amenable number.
152305412732 is a deficient number, since it is larger than the sum of its proper divisors (139042203268).
152305412732 is a wasteful number, since it uses less digits than its factorization.
152305412732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6937361 (or 6937359 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 35.
Adding to 152305412732 its reverse (237214503251), we get a palindrome (389519915983).
The spelling of 152305412732 in words is "one hundred fifty-two billion, three hundred five million, four hundred twelve thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •