Base | Representation |
---|---|
bin | 1110100011100101011011… |
… | …0110101100101101110100 |
3 | 2002200000102111022222221102 |
4 | 3220321112312230231310 |
5 | 4044204211330340104 |
6 | 54012211312505232 |
7 | 3241200363443162 |
oct | 350712666545564 |
9 | 62600374288842 |
10 | 16004505324404 |
11 | 5110522023373 |
12 | 196594454b218 |
13 | 8c12aba0743c |
14 | 3d489d412232 |
15 | 1cb4a96bba1e |
hex | e8e56dacb74 |
16004505324404 has 12 divisors (see below), whose sum is σ = 28009829275428. Its totient is φ = 8001696960000.
The previous prime is 16004505324403. The next prime is 16004505324439. The reversal of 16004505324404 is 40442350540061.
It can be written as a sum of positive squares in 2 ways, for example, as 10145830303504 + 5858675020900 = 3185252^2 + 2420470^2 .
It is a super-2 number, since 2×160045053244042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16004505324403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138860747 + ... + 138975954.
It is an arithmetic number, because the mean of its divisors is an integer number (2334152439619).
Almost surely, 216004505324404 is an apocalyptic number.
It is an amenable number.
16004505324404 is a deficient number, since it is larger than the sum of its proper divisors (12005323951024).
16004505324404 is a wasteful number, since it uses less digits than its factorization.
16004505324404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277851106 (or 277851104 counting only the distinct ones).
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 16004505324404 its reverse (40442350540061), we get a palindrome (56446855864465).
The spelling of 16004505324404 in words is "sixteen trillion, four billion, five hundred five million, three hundred twenty-four thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •