Base | Representation |
---|---|
bin | 1000111001110000100… |
… | …1111011110001101000 |
3 | 112121202220120020020210 |
4 | 2032130021323301220 |
5 | 10001212042031232 |
6 | 154132242221120 |
7 | 14023042021065 |
oct | 2163411736150 |
9 | 477686506223 |
10 | 152943705192 |
11 | 59954809463 |
12 | 257846547a0 |
13 | 115653b3355 |
14 | 758c701c6c |
15 | 3ea22535cc |
hex | 239c27bc68 |
152943705192 has 32 divisors (see below), whose sum is σ = 383230267200. Its totient is φ = 50865101184.
The previous prime is 152943705191. The next prime is 152943705227. The reversal of 152943705192 is 291507349251.
152943705192 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (152943705191) 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, 7247613 + ... + 7268684.
It is an arithmetic number, because the mean of its divisors is an integer number (11975945850).
Almost surely, 2152943705192 is an apocalyptic number.
152943705192 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
152943705192 is an abundant number, since it is smaller than the sum of its proper divisors (230286562008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152943705192 is a wasteful number, since it uses less digits than its factorization.
152943705192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14516745 (or 14516741 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 48.
The spelling of 152943705192 in words is "one hundred fifty-two billion, nine hundred forty-three million, seven hundred five thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •