Base | Representation |
---|---|
bin | 1110100110001101110000… |
… | …1100100111101101100000 |
3 | 2002211100001122020201211101 |
4 | 3221203130030213231200 |
5 | 4100424232140120020 |
6 | 54045043214324144 |
7 | 3244360222014634 |
oct | 351433414475540 |
9 | 62740048221741 |
10 | 16049692113760 |
11 | 51286aa868a88 |
12 | 19726554b9654 |
13 | 8c5630528816 |
14 | 3d6b487c4dc4 |
15 | 1cc75170500a |
hex | e98dc327b60 |
16049692113760 has 48 divisors (see below), whose sum is σ = 37957185385056. Its totient is φ = 6413140292608.
The previous prime is 16049692113667. The next prime is 16049692113769. The reversal of 16049692113760 is 6731129694061.
16049692113760 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16049692113769) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52476364 + ... + 52781323.
It is an arithmetic number, because the mean of its divisors is an integer number (790774695522).
Almost surely, 216049692113760 is an apocalyptic number.
16049692113760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16049692113760 is an abundant number, since it is smaller than the sum of its proper divisors (21907493271296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16049692113760 is a wasteful number, since it uses less digits than its factorization.
16049692113760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105258655 (or 105258647 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 55.
The spelling of 16049692113760 in words is "sixteen trillion, forty-nine billion, six hundred ninety-two million, one hundred thirteen thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •