Base | Representation |
---|---|
bin | 110011001110010000… |
… | …0101101001111010000 |
3 | 101111221002102002010011 |
4 | 1212130200231033100 |
5 | 3300240000031000 |
6 | 122311105444304 |
7 | 10642621406200 |
oct | 1463440551720 |
9 | 344832362104 |
10 | 110000002000 |
11 | 42718151669 |
12 | 1939a940694 |
13 | a4b04caaa5 |
14 | 54771c4400 |
15 | 2cdc0e82ba |
hex | 199c82d3d0 |
110000002000 has 120 divisors (see below), whose sum is σ = 309405587400. Its totient is φ = 37714252800.
The previous prime is 110000001977. The next prime is 110000002087. The reversal of 110000002000 is 200000011.
It can be written as a sum of positive squares in 4 ways, for example, as 632220736 + 109367781264 = 25144^2 + 330708^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 463225 + ... + 659224.
It is an arithmetic number, because the mean of its divisors is an integer number (2578379895).
Almost surely, 2110000002000 is an apocalyptic number.
110000002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110000002000 is an abundant number, since it is smaller than the sum of its proper divisors (199405585400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000002000 is a wasteful number, since it uses less digits than its factorization.
110000002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122486 (or 1122463 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
Adding to 110000002000 its reverse (200000011), we get a palindrome (110200002011).
The spelling of 110000002000 in words is "one hundred ten billion, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •