Base | Representation |
---|---|
bin | 1110111101100011110010… |
… | …0011111110011111100000 |
3 | 2011020200020102010021101120 |
4 | 3233120330203332133200 |
5 | 4124012104121321043 |
6 | 54553211015532240 |
7 | 3315345456454350 |
oct | 357307443763740 |
9 | 64220212107346 |
10 | 16450740807648 |
11 | 52727a1352644 |
12 | 1a1831b98a080 |
13 | 9243b51c2a94 |
14 | 40c311d6cb60 |
15 | 1d7dc51ec983 |
hex | ef63c8fe7e0 |
16450740807648 has 384 divisors, whose sum is σ = 52432664739840. Its totient is φ = 4408742338560.
The previous prime is 16450740807581. The next prime is 16450740807671. The reversal of 16450740807648 is 84670804705461.
It is a junction number, because it is equal to n+sod(n) for n = 16450740807591 and 16450740807600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4750428765 + ... + 4750432227.
It is an arithmetic number, because the mean of its divisors is an integer number (136543397760).
Almost surely, 216450740807648 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 16450740807648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26216332369920).
16450740807648 is an abundant number, since it is smaller than the sum of its proper divisors (35981923932192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16450740807648 is a wasteful number, since it uses less digits than its factorization.
16450740807648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4790 (or 4782 counting only the distinct ones).
The product of its (nonzero) digits is 36126720, while the sum is 60.
The spelling of 16450740807648 in words is "sixteen trillion, four hundred fifty billion, seven hundred forty million, eight hundred seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •