Base | Representation |
---|---|
bin | 1110100100110001000110… |
… | …1111000110110000001000 |
3 | 2002201221212022000000002102 |
4 | 3221030101233012300020 |
5 | 4100022313024324342 |
6 | 54025411222252532 |
7 | 3242516664111200 |
oct | 351142157066010 |
9 | 62657768000072 |
10 | 16024820542472 |
11 | 51190a7480395 |
12 | 1969873b87148 |
13 | 8c31987aa831 |
14 | 3d586950d400 |
15 | 1cbc97e50832 |
hex | e9311bc6c08 |
16024820542472 has 96 divisors (see below), whose sum is σ = 35260173296640. Its totient is φ = 6807501792000.
The previous prime is 16024820542457. The next prime is 16024820542529. The reversal of 16024820542472 is 27424502842061.
It is a happy number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 20658197 + ... + 21419867.
It is an arithmetic number, because the mean of its divisors is an integer number (367293471840).
Almost surely, 216024820542472 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 16024820542472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17630086648320).
16024820542472 is an abundant number, since it is smaller than the sum of its proper divisors (19235352754168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16024820542472 is a wasteful number, since it uses less digits than its factorization.
16024820542472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762163 (or 762152 counting only the distinct ones).
The product of its (nonzero) digits is 1720320, while the sum is 47.
The spelling of 16024820542472 in words is "sixteen trillion, twenty-four billion, eight hundred twenty million, five hundred forty-two thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •