Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0101111000000100000010 |
3 | 1100012000220010002210011012 |
4 | 2110232032011320010002 |
5 | 2314421241420232320 |
6 | 33423015413520522 |
7 | 2103243611010332 |
oct | 224561605700402 |
9 | 40160803083135 |
10 | 10220111102210 |
11 | 3290363308a49 |
12 | 1190886643142 |
13 | 5919a1b82279 |
14 | 2749281770c2 |
15 | 12acadc7c4c5 |
hex | 94b8e178102 |
10220111102210 has 32 divisors (see below), whose sum is σ = 18592149454272. Its totient is φ = 4044598972480.
The previous prime is 10220111102129. The next prime is 10220111102287. The reversal of 10220111102210 is 1220111102201.
It is a super-2 number, since 2×102201111022102 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 5351096 + ... + 7005315.
It is an arithmetic number, because the mean of its divisors is an integer number (581004670446).
Almost surely, 210220111102210 is an apocalyptic number.
10220111102210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10220111102210 is a deficient number, since it is larger than the sum of its proper divisors (8372038352062).
10220111102210 is a wasteful number, since it uses less digits than its factorization.
10220111102210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12357298.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10220111102210 its reverse (1220111102201), we get a palindrome (11440222204411).
Subtracting from 10220111102210 its reverse (1220111102201), we obtain a palindrome (9000000000009).
The spelling of 10220111102210 in words is "ten trillion, two hundred twenty billion, one hundred eleven million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •