Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …101101000100101011001000 |
3 | 112102111002200012022010010102 |
4 | 121000233130231010223020 |
5 | 103404233310204033000 |
6 | 1025542134413104532 |
7 | 32112250560223424 |
oct | 3100573455045310 |
9 | 472432605263112 |
10 | 110002110221000 |
11 | 320606a651a498 |
12 | 10407190188148 |
13 | 494c20152a63a |
14 | 1d241b82cbb84 |
15 | cab619ae83d5 |
hex | 640bdcb44ac8 |
110002110221000 has 32 divisors (see below), whose sum is σ = 257404937919480. Its totient is φ = 44000844088000.
The previous prime is 110002110220973. The next prime is 110002110221033. The reversal of 110002110221000 is 122011200011.
It can be written as a sum of positive squares in 4 ways, for example, as 18790785807556 + 91211324413444 = 4334834^2 + 9550462^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55001054111 + ... + 55001056110.
Almost surely, 2110002110221000 is an apocalyptic number.
110002110221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002110221000 is an abundant number, since it is smaller than the sum of its proper divisors (147402827698480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002110221000 is a wasteful number, since it uses less digits than its factorization.
110002110221000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110002110242 (or 110002110228 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110002110221000 its reverse (122011200011), we get a palindrome (110124121421011).
The spelling of 110002110221000 in words is "one hundred ten trillion, two billion, one hundred ten million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •