Base | Representation |
---|---|
bin | 1111010101001011100101… |
… | …0111101000001101000000 |
3 | 2012200110201202121222211200 |
4 | 3311102321113220031000 |
5 | 4202134214240222243 |
6 | 55503444132541200 |
7 | 3356563211626614 |
oct | 365227127501500 |
9 | 65613652558750 |
10 | 16856561648448 |
11 | 5409911667875 |
12 | 1a82ab8481800 |
13 | 95374a75b902 |
14 | 423c0d225344 |
15 | 1e3727b3ead3 |
hex | f54b95e8340 |
16856561648448 has 84 divisors (see below), whose sum is σ = 48561551103780. Its totient is φ = 5590331744256.
The previous prime is 16856561648359. The next prime is 16856561648533. The reversal of 16856561648448 is 84484616565861.
16856561648448 is a `hidden beast` number, since 1 + 6 + 8 + 5 + 65 + 61 + 64 + 8 + 448 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 8888316643584 + 7968245004864 = 2981328^2 + 2822808^2 .
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 74162833 + ... + 74389776.
Almost surely, 216856561648448 is an apocalyptic number.
16856561648448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
16856561648448 is an abundant number, since it is smaller than the sum of its proper divisors (31704989455332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16856561648448 is a wasteful number, since it uses less digits than its factorization.
16856561648448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148552824 (or 148552811 counting only the distinct ones).
The product of its digits is 1061683200, while the sum is 72.
The spelling of 16856561648448 in words is "sixteen trillion, eight hundred fifty-six billion, five hundred sixty-one million, six hundred forty-eight thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •