Base | Representation |
---|---|
bin | 1111011101010100000001… |
… | …1111001011000111111000 |
3 | 2020011211100002211210102111 |
4 | 3313111000133023013320 |
5 | 4211431323440112440 |
6 | 100051551050142104 |
7 | 3402640232045362 |
oct | 367250037130770 |
9 | 66154302753374 |
10 | 16996267504120 |
11 | 5463092a06a23 |
12 | 1aa5ba7721934 |
13 | 9639833c31b8 |
14 | 42a8a3765d32 |
15 | 1e71a2b0c4ea |
hex | f75407cb1f8 |
16996267504120 has 32 divisors (see below), whose sum is σ = 38332437081120. Its totient is φ = 6782358522240.
The previous prime is 16996267504093. The next prime is 16996267504127. The reversal of 16996267504120 is 2140576269961.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16996267504127) 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, 504622932 + ... + 504656611.
It is an arithmetic number, because the mean of its divisors is an integer number (1197888658785).
Almost surely, 216996267504120 is an apocalyptic number.
16996267504120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16996267504120 is an abundant number, since it is smaller than the sum of its proper divisors (21336169577000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16996267504120 is a wasteful number, since it uses less digits than its factorization.
16996267504120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1009279975 (or 1009279971 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 58.
The spelling of 16996267504120 in words is "sixteen trillion, nine hundred ninety-six billion, two hundred sixty-seven million, five hundred four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •