Base | Representation |
---|---|
bin | 110011010100110110… |
… | …0100001001001011100 |
3 | 101112111111122012111012 |
4 | 1212221230201021130 |
5 | 3301213111431022 |
6 | 122345050514352 |
7 | 10651245521165 |
oct | 1465154411134 |
9 | 345444565435 |
10 | 110221202012 |
11 | 42820aa4499 |
12 | 19440a359b8 |
13 | a51729877c |
14 | 549872476c |
15 | 2d0173dde2 |
hex | 19a9b2125c |
110221202012 has 12 divisors (see below), whose sum is σ = 193736828040. Its totient is φ = 54867822576.
The previous prime is 110221201997. The next prime is 110221202027. The reversal of 110221202012 is 210202122011.
It is an interprime number because it is at equal distance from previous prime (110221201997) and next prime (110221202027).
It is a super-2 number, since 2×1102212020122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 60693587 + ... + 60695402.
It is an arithmetic number, because the mean of its divisors is an integer number (16144735670).
Almost surely, 2110221202012 is an apocalyptic number.
It is an amenable number.
110221202012 is a deficient number, since it is larger than the sum of its proper divisors (83515626028).
110221202012 is a wasteful number, since it uses less digits than its factorization.
110221202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121389220 (or 121389218 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110221202012 its reverse (210202122011), we get a palindrome (320423324023).
It can be divided in two parts, 110 and 221202012, that added together give a palindrome (221202122).
The spelling of 110221202012 in words is "one hundred ten billion, two hundred twenty-one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •