Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0110010010101000000 |
3 | 101111221020101200110121 |
4 | 1212130220302111000 |
5 | 3300241020320000 |
6 | 122311223110024 |
7 | 10642645410133 |
oct | 1463450622500 |
9 | 344836350417 |
10 | 110002120000 |
11 | 42719368983 |
12 | 1939b5a2314 |
13 | a4b0a8cb46 |
14 | 54775b621a |
15 | 2cdc3b5b1a |
hex | 199ca32540 |
110002120000 has 70 divisors (see below), whose sum is σ = 272769606098. Its totient is φ = 44000832000.
The previous prime is 110002119989. The next prime is 110002120043. The reversal of 110002120000 is 21200011.
It can be written as a sum of positive squares in 5 ways, for example, as 9837465856 + 100164654144 = 99184^2 + 316488^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1335027 + ... + 1415026.
Almost surely, 2110002120000 is an apocalyptic number.
110002120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002120000 is an abundant number, since it is smaller than the sum of its proper divisors (162767486098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002120000 is an frugal number, since it uses more digits than its factorization.
110002120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2750085 (or 2750060 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 110002120000 its reverse (21200011), we get a palindrome (110023320011).
It can be divided in two parts, 1 and 10002120000, that added together give a palindrome (10002120001).
The spelling of 110002120000 in words is "one hundred ten billion, two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •