Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0100101100011100110 |
3 | 101112110201221202022110 |
4 | 1212221002211203212 |
5 | 3301202303210042 |
6 | 122344015141450 |
7 | 10651053220443 |
oct | 1465102454346 |
9 | 345421852273 |
10 | 110210210022 |
11 | 42815877000 |
12 | 19439214886 |
13 | a514c1a533 |
14 | 54970a29ca |
15 | 2d007bc09c |
hex | 19a90a58e6 |
110210210022 has 64 divisors (see below), whose sum is σ = 242693065728. Its totient is φ = 33362991200.
The previous prime is 110210210021. The next prime is 110210210053. The reversal of 110210210022 is 220012012011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110210210021) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 8466643 + ... + 8479649.
It is an arithmetic number, because the mean of its divisors is an integer number (3792079152).
Almost surely, 2110210210022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110210210022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121346532864).
110210210022 is an abundant number, since it is smaller than the sum of its proper divisors (132482855706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110210210022 is a wasteful number, since it uses less digits than its factorization.
110210210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14106 (or 14084 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110210210022 its reverse (220012012011), we get a palindrome (330222222033).
The spelling of 110210210022 in words is "one hundred ten billion, two hundred ten million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •