Base | Representation |
---|---|
bin | 11111000100110001… |
… | …10111101010001100 |
3 | 1121001200010212121202 |
4 | 33202120313222030 |
5 | 233131331302030 |
6 | 11355240045032 |
7 | 1130264526200 |
oct | 174230675214 |
9 | 47050125552 |
10 | 16683072140 |
11 | 7091183029 |
12 | 3297163778 |
13 | 175b449627 |
14 | b43980b00 |
15 | 679972745 |
hex | 3e2637a8c |
16683072140 has 72 divisors (see below), whose sum is σ = 40862802960. Its totient is φ = 5704691328.
The previous prime is 16683072101. The next prime is 16683072143. The reversal of 16683072140 is 4127038661.
It is a junction number, because it is equal to n+sod(n) for n = 16683072094 and 16683072103.
It is not an unprimeable number, because it can be changed into a prime (16683072143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 348962 + ... + 393878.
It is an arithmetic number, because the mean of its divisors is an integer number (567538930).
Almost surely, 216683072140 is an apocalyptic number.
16683072140 is a gapful number since it is divisible by the number (10) 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 16683072140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20431401480).
16683072140 is an abundant number, since it is smaller than the sum of its proper divisors (24179730820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16683072140 is a wasteful number, since it uses less digits than its factorization.
16683072140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45319 (or 45310 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 16683072140 in words is "sixteen billion, six hundred eighty-three million, seventy-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •