Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1001110100100100000 |
3 | 101111221210102002222011 |
4 | 1212131013032210200 |
5 | 3300300041200000 |
6 | 122312110122304 |
7 | 10643103264343 |
oct | 1463507164440 |
9 | 344853362864 |
10 | 110010100000 |
11 | 42722919419 |
12 | 193a21b0394 |
13 | a4b2625138 |
14 | 547869245a |
15 | 2cdce402ba |
hex | 199d1ce920 |
110010100000 has 72 divisors (see below), whose sum is σ = 270710899956. Its totient is φ = 44004000000.
The previous prime is 110010099973. The next prime is 110010100019. The reversal of 110010100000 is 1010011.
It can be written as a sum of positive squares in 6 ways, for example, as 13097429136 + 96912670864 = 114444^2 + 311308^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
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 11 ways as a sum of consecutive naturals, for example, 450051 + ... + 650050.
Almost surely, 2110010100000 is an apocalyptic number.
110010100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110010100000 is an abundant number, since it is smaller than the sum of its proper divisors (160700799956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110010100000 is an frugal number, since it uses more digits than its factorization.
110010100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100136 (or 1100108 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 110010100000 its reverse (1010011), we get a palindrome (110011110011).
The spelling of 110010100000 in words is "one hundred ten billion, ten million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •