Base | Representation |
---|---|
bin | 1110111111000101010000… |
… | …0001100101110100101000 |
3 | 2011100011202210020212222120 |
4 | 3233301110001211310220 |
5 | 4124424144442010124 |
6 | 55013215121151240 |
7 | 3320263022166024 |
oct | 357612401456450 |
9 | 64304683225876 |
10 | 16476904250664 |
11 | 52828a7996620 |
12 | 1a21401a8b520 |
13 | 9269c4791100 |
14 | 40d6b4a4b384 |
15 | 1d89070d8d79 |
hex | efc54065d28 |
16476904250664 has 384 divisors, whose sum is σ = 50699156705280. Its totient is φ = 4418525030400.
The previous prime is 16476904250647. The next prime is 16476904250699. The reversal of 16476904250664 is 46605240967461.
It is a junction number, because it is equal to n+sod(n) for n = 16476904250598 and 16476904250607.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 147935604 + ... + 148046940.
It is an arithmetic number, because the mean of its divisors is an integer number (132029053920).
Almost surely, 216476904250664 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 16476904250664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25349578352640).
16476904250664 is an abundant number, since it is smaller than the sum of its proper divisors (34222252454616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16476904250664 is a wasteful number, since it uses less digits than its factorization.
16476904250664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111521 (or 111504 counting only the distinct ones).
The product of its (nonzero) digits is 52254720, while the sum is 60.
The spelling of 16476904250664 in words is "sixteen trillion, four hundred seventy-six billion, nine hundred four million, two hundred fifty thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •