Base | Representation |
---|---|
bin | 1110100011100110010010… |
… | …0111111111100100000000 |
3 | 2002200001000121001100010011 |
4 | 3220321210213333210000 |
5 | 4044210200001203324 |
6 | 54012250244314304 |
7 | 3241206200231431 |
oct | 350714447774400 |
9 | 62601017040104 |
10 | 16004736350464 |
11 | 51106304776a4 |
12 | 19659a99a2994 |
13 | 8c1317835754 |
14 | 3d48c1d8d488 |
15 | 1cb4beb03c94 |
hex | e8e649ff900 |
16004736350464 has 27 divisors (see below), whose sum is σ = 31947081968977. Its totient is φ = 8002336170496.
The previous prime is 16004736350441. The next prime is 16004736350563. The reversal of 16004736350464 is 46405363740061.
The square root of 16004736350464 is 4000592.
It is a perfect power (a square), and thus also a powerful number.
16004736350464 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 28791302400 + 15975945048064 = 169680^2 + 3996992^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 63884454 + ... + 64134490.
Almost surely, 216004736350464 is an apocalyptic number.
16004736350464 is the 4000592-nd square number.
It is an amenable number.
16004736350464 is a deficient number, since it is larger than the sum of its proper divisors (15942345618513).
16004736350464 is an frugal number, since it uses more digits than its factorization.
16004736350464 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500090 (or 250039 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 49.
Multiplying 16004736350464 by its sum of digits (49), we get a square (784232081172736 = 280041442).
The spelling of 16004736350464 in words is "sixteen trillion, four billion, seven hundred thirty-six million, three hundred fifty thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •