Base | Representation |
---|---|
bin | 1000111001001111101… |
… | …0111110111111000100 |
3 | 112121102021122011021020 |
4 | 2032103322332333010 |
5 | 10000421211142302 |
6 | 154110425351140 |
7 | 14016443621055 |
oct | 2162372767704 |
9 | 477367564236 |
10 | 152805568452 |
11 | 5989383a269 |
12 | 257463384b0 |
13 | 115428a9134 |
14 | 757822472c |
15 | 3e95068ebc |
hex | 2393ebefc4 |
152805568452 has 12 divisors (see below), whose sum is σ = 356546326416. Its totient is φ = 50935189480.
The previous prime is 152805568427. The next prime is 152805568469. The reversal of 152805568452 is 254865508251.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 152805568395 and 152805568404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6366898674 + ... + 6366898697.
It is an arithmetic number, because the mean of its divisors is an integer number (29712193868).
Almost surely, 2152805568452 is an apocalyptic number.
152805568452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
152805568452 is an abundant number, since it is smaller than the sum of its proper divisors (203740757964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152805568452 is a wasteful number, since it uses less digits than its factorization.
152805568452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12733797378 (or 12733797376 counting only the distinct ones).
The product of its (nonzero) digits is 3840000, while the sum is 51.
The spelling of 152805568452 in words is "one hundred fifty-two billion, eight hundred five million, five hundred sixty-eight thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •