Base | Representation |
---|---|
bin | 100000001110… |
… | …1111010011100 |
3 | 1011210121002022 |
4 | 1000131322130 |
5 | 13311242430 |
6 | 1402115312 |
7 | 263434244 |
oct | 100357234 |
9 | 34717068 |
10 | 16899740 |
11 | 95a3030 |
12 | 57abb38 |
13 | 3669260 |
14 | 235cb24 |
15 | 173c4e5 |
hex | 101de9c |
16899740 has 96 divisors (see below), whose sum is σ = 44029440. Its totient is φ = 5356800.
The previous prime is 16899709. The next prime is 16899761. The reversal of 16899740 is 4799861.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a junction number, because it is equal to n+sod(n) for n = 16899691 and 16899700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54185 + ... + 54495.
It is an arithmetic number, because the mean of its divisors is an integer number (458640).
Almost surely, 216899740 is an apocalyptic number.
16899740 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 16899740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22014720).
16899740 is an abundant number, since it is smaller than the sum of its proper divisors (27129700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16899740 is a wasteful number, since it uses less digits than its factorization.
16899740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363 (or 361 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 44.
The square root of 16899740 is about 4110.9293353207. The cubic root of 16899740 is about 256.6216783652.
The spelling of 16899740 in words is "sixteen million, eight hundred ninety-nine thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •