Base | Representation |
---|---|
bin | 1001010010111001010010… |
… | …0101101101010100011110 |
3 | 1100012001011201012221212211 |
4 | 2110232110211231110132 |
5 | 2314422002322010420 |
6 | 33423034310151034 |
7 | 2103246403400533 |
oct | 224562445552436 |
9 | 40161151187784 |
10 | 10220220110110 |
11 | 32904098a221a |
12 | 11908b705247a |
13 | 5919bb62ab9a |
14 | 274938830d8a |
15 | 12acb8610e5a |
hex | 94b9496d51e |
10220220110110 has 8 divisors (see below), whose sum is σ = 18396396198216. Its totient is φ = 4088088044040.
The previous prime is 10220220110071. The next prime is 10220220110119. The reversal of 10220220110110 is 1101102202201.
10220220110110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220220110119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 511011005496 + ... + 511011005515.
It is an arithmetic number, because the mean of its divisors is an integer number (2299549524777).
Almost surely, 210220220110110 is an apocalyptic number.
10220220110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10220220110110 is a deficient number, since it is larger than the sum of its proper divisors (8176176088106).
10220220110110 is a wasteful number, since it uses less digits than its factorization.
10220220110110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1022022011018.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10220220110110 its reverse (1101102202201), we get a palindrome (11321322312311).
The spelling of 10220220110110 in words is "ten trillion, two hundred twenty billion, two hundred twenty million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •