Base | Representation |
---|---|
bin | 110011001110111000… |
… | …0110110011000111000 |
3 | 101111222112221110001021 |
4 | 1212131300312120320 |
5 | 3300310334323000 |
6 | 122313140032224 |
7 | 10643265110005 |
oct | 1463560663070 |
9 | 344875843037 |
10 | 110021011000 |
11 | 42728aa0a7a |
12 | 193a5992674 |
13 | a4b4975554 |
14 | 5479cd28ac |
15 | 2cddd9811a |
hex | 199dc36638 |
110021011000 has 32 divisors (see below), whose sum is σ = 257449168080. Its totient is φ = 44008404000.
The previous prime is 110021010997. The next prime is 110021011027. The reversal of 110021011000 is 110120011.
It is a super-2 number, since 2×1100210110002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55009506 + ... + 55011505.
Almost surely, 2110021011000 is an apocalyptic number.
110021011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110021011000 is an abundant number, since it is smaller than the sum of its proper divisors (147428157080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110021011000 is a wasteful number, since it uses less digits than its factorization.
110021011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110021032 (or 110021018 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 110021011000 its reverse (110120011), we get a palindrome (110131131011).
The spelling of 110021011000 in words is "one hundred ten billion, twenty-one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •