Base | Representation |
---|---|
bin | 11110100011110011… |
… | …00010111100110000 |
3 | 1120100101120202121220 |
4 | 33101321202330300 |
5 | 232100021103032 |
6 | 11311554345040 |
7 | 1120365213000 |
oct | 172171427460 |
9 | 46311522556 |
10 | 16406425392 |
11 | 6a59aaa255 |
12 | 321a58b180 |
13 | 1716037326 |
14 | b18d2a000 |
15 | 66052812c |
hex | 3d1e62f30 |
16406425392 has 160 divisors (see below), whose sum is σ = 49550400000. Its totient is φ = 4675813632.
The previous prime is 16406425363. The next prime is 16406425393. The reversal of 16406425392 is 29352460461.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (16406425393) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8214538 + ... + 8216534.
It is an arithmetic number, because the mean of its divisors is an integer number (309690000).
Almost surely, 216406425392 is an apocalyptic number.
16406425392 is a gapful number since it is divisible by the number (12) 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 16406425392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24775200000).
16406425392 is an abundant number, since it is smaller than the sum of its proper divisors (33143974608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16406425392 is a wasteful number, since it uses less digits than its factorization.
16406425392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2528 (or 2508 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 42.
The spelling of 16406425392 in words is "sixteen billion, four hundred six million, four hundred twenty-five thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •