Base | Representation |
---|---|
bin | 11111000111101000… |
… | …00010111010000000 |
3 | 1121010100010011212100 |
4 | 33203310002322000 |
5 | 233203441121222 |
6 | 11401452230400 |
7 | 1131004634001 |
oct | 174364027200 |
9 | 47110104770 |
10 | 16706973312 |
11 | 70a3718367 |
12 | 32a316b400 |
13 | 1763397633 |
14 | b46c031a8 |
15 | 67bae44ac |
hex | 3e3d02e80 |
16706973312 has 384 divisors, whose sum is σ = 54991872000. Its totient is φ = 4836851712.
The previous prime is 16706973307. The next prime is 16706973319. The reversal of 16706973312 is 21337960761.
It is a tau number, because it is divible by the number of its divisors (384).
It is not an unprimeable number, because it can be changed into a prime (16706973319) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13061889 + ... + 13063167.
It is an arithmetic number, because the mean of its divisors is an integer number (143208000).
Almost surely, 216706973312 is an apocalyptic number.
16706973312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16706973312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27495936000).
16706973312 is an abundant number, since it is smaller than the sum of its proper divisors (38284898688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16706973312 is a wasteful number, since it uses less digits than its factorization.
16706973312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368 (or 1353 counting only the distinct ones).
The product of its (nonzero) digits is 285768, while the sum is 45.
The spelling of 16706973312 in words is "sixteen billion, seven hundred six million, nine hundred seventy-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •