Base | Representation |
---|---|
bin | 11110010110001100… |
… | …11001101111100000 |
3 | 1120001102221101112001 |
4 | 33023012121233200 |
5 | 231331320330130 |
6 | 11252401413344 |
7 | 1114511506243 |
oct | 171306315740 |
9 | 46042841461 |
10 | 16292355040 |
11 | 6a00678535 |
12 | 31a833a254 |
13 | 16c8508390 |
14 | b07b1525a |
15 | 6554e46ca |
hex | 3cb199be0 |
16292355040 has 192 divisors, whose sum is σ = 43951541760. Its totient is φ = 5663416320.
The previous prime is 16292354989. The next prime is 16292355047. The reversal of 16292355040 is 4055329261.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16292355047) 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, 2382346 + ... + 2389174.
It is an arithmetic number, because the mean of its divisors is an integer number (228914280).
Almost surely, 216292355040 is an apocalyptic number.
16292355040 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 16292355040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21975770880).
16292355040 is an abundant number, since it is smaller than the sum of its proper divisors (27659186720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16292355040 is a wasteful number, since it uses less digits than its factorization.
16292355040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6925 (or 6917 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 16292355040 in words is "sixteen billion, two hundred ninety-two million, three hundred fifty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •