Base | Representation |
---|---|
bin | 110011001110111010… |
… | …1011000101011001010 |
3 | 101111222122011212001200 |
4 | 1212131311120223022 |
5 | 3300311140400020 |
6 | 122313221325030 |
7 | 10643311161342 |
oct | 1463565305312 |
9 | 344878155050 |
10 | 110022200010 |
11 | 42729733328 |
12 | 193a6266776 |
13 | a4b4ca07c8 |
14 | 547a121d22 |
15 | 2cde030590 |
hex | 199dd58aca |
110022200010 has 24 divisors (see below), whose sum is σ = 286057720260. Its totient is φ = 29339253312.
The previous prime is 110022199979. The next prime is 110022200011. The reversal of 110022200010 is 10002220011.
It can be written as a sum of positive squares in 2 ways, for example, as 99976748481 + 10045451529 = 316191^2 + 100227^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110022199965 and 110022200001.
It is not an unprimeable number, because it can be changed into a prime (110022200011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611234355 + ... + 611234534.
Almost surely, 2110022200010 is an apocalyptic number.
110022200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110022200010 is an abundant number, since it is smaller than the sum of its proper divisors (176035520250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110022200010 is a wasteful number, since it uses less digits than its factorization.
110022200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1222468902 (or 1222468899 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 110022200010 its reverse (10002220011), we get a palindrome (120024420021).
The spelling of 110022200010 in words is "one hundred ten billion, twenty-two million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •