Base | Representation |
---|---|
bin | 11110000110111001… |
… | …11110101011100000 |
3 | 1112201111112010000110 |
4 | 33003130332223200 |
5 | 231100444241101 |
6 | 11231535451320 |
7 | 1111363131021 |
oct | 170334765340 |
9 | 45644463013 |
10 | 16164055776 |
11 | 6945208390 |
12 | 3171386b40 |
13 | 16a7a66a5b |
14 | ad4a78c48 |
15 | 6490eecd6 |
hex | 3c373eae0 |
16164055776 has 48 divisors (see below), whose sum is σ = 46287980928. Its totient is φ = 4898198400.
The previous prime is 16164055729. The next prime is 16164055799. The reversal of 16164055776 is 67755046161.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×161640557762 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7652380 + ... + 7654491.
It is an arithmetic number, because the mean of its divisors is an integer number (964332936).
Almost surely, 216164055776 is an apocalyptic number.
16164055776 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
16164055776 is an abundant number, since it is smaller than the sum of its proper divisors (30123925152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16164055776 is a wasteful number, since it uses less digits than its factorization.
16164055776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15306895 (or 15306887 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 48.
The spelling of 16164055776 in words is "sixteen billion, one hundred sixty-four million, fifty-five thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •