Base | Representation |
---|---|
bin | 111110100001110… |
… | …1001111000110000 |
3 | 12102012222000211210 |
4 | 1331003221320300 |
5 | 13244104010000 |
6 | 544105440120 |
7 | 102664432530 |
oct | 17503517060 |
9 | 5365860753 |
10 | 2098110000 |
11 | 987368108 |
12 | 4a67a0040 |
13 | 2758a880c |
14 | 15c9174c0 |
15 | c42e2350 |
hex | 7d0e9e30 |
2098110000 has 400 divisors, whose sum is σ = 7896272384. Its totient is φ = 470016000.
The previous prime is 2098109999. The next prime is 2098110013. The reversal of 2098110000 is 118902.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 20369949 + ... + 20370051.
Almost surely, 22098110000 is an apocalyptic number.
2098110000 is a gapful number since it is divisible by the number (20) 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 2098110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3948136192).
2098110000 is an abundant number, since it is smaller than the sum of its proper divisors (5798162384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2098110000 is a wasteful number, since it uses less digits than its factorization.
2098110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238 (or 217 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
The square root of 2098110000 is about 45805.1307169841. The cubic root of 2098110000 is about 1280.1948759282.
Adding to 2098110000 its reverse (118902), we get a palindrome (2098228902).
The spelling of 2098110000 in words is "two billion, ninety-eight million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •