Base | Representation |
---|---|
bin | 11101110110010111… |
… | …00111011100101000 |
3 | 1112100211101220021102 |
4 | 32323023213130220 |
5 | 230304433131230 |
6 | 11210101300532 |
7 | 1105056454502 |
oct | 167313473450 |
9 | 45324356242 |
10 | 16025286440 |
11 | 6883946989 |
12 | 3132a04748 |
13 | 168509a917 |
14 | ac0474d72 |
15 | 63bd3d045 |
hex | 3bb2e7728 |
16025286440 has 64 divisors (see below), whose sum is σ = 36920664000. Its totient is φ = 6256760832.
The previous prime is 16025286437. The next prime is 16025286449. The reversal of 16025286440 is 4468252061.
It is a junction number, because it is equal to n+sod(n) for n = 16025286394 and 16025286403.
It is not an unprimeable number, because it can be changed into a prime (16025286449) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3907511 + ... + 3911609.
It is an arithmetic number, because the mean of its divisors is an integer number (576885375).
Almost surely, 216025286440 is an apocalyptic number.
16025286440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16025286440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18460332000).
16025286440 is an abundant number, since it is smaller than the sum of its proper divisors (20895377560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16025286440 is a wasteful number, since it uses less digits than its factorization.
16025286440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6426 (or 6422 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 38.
The spelling of 16025286440 in words is "sixteen billion, twenty-five million, two hundred eighty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •