Base | Representation |
---|---|
bin | 11110101001001111… |
… | …11000100101100000 |
3 | 1120110120120122112201 |
4 | 33110213320211200 |
5 | 232143221031242 |
6 | 11320310102544 |
7 | 1121461526023 |
oct | 172447704540 |
9 | 46416518481 |
10 | 16452127072 |
11 | 6a82884637 |
12 | 323194aa54 |
13 | 1722649144 |
14 | b210251ba |
15 | 6645544b7 |
hex | 3d49f8960 |
16452127072 has 48 divisors (see below), whose sum is σ = 33239750544. Its totient is φ = 8011008000.
The previous prime is 16452127057. The next prime is 16452127091. The reversal of 16452127072 is 27072125461.
16452127072 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 738172 + ... + 760132.
It is an arithmetic number, because the mean of its divisors is an integer number (692494803).
Almost surely, 216452127072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16452127072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16619875272).
16452127072 is an abundant number, since it is smaller than the sum of its proper divisors (16787623472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16452127072 is a wasteful number, since it uses less digits than its factorization.
16452127072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22583 (or 22575 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 37.
The spelling of 16452127072 in words is "sixteen billion, four hundred fifty-two million, one hundred twenty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •