Base | Representation |
---|---|
bin | 10000010011001100011… |
… | …111001010111010110010 |
3 | 10222002020020120110120221 |
4 | 100103030133022322302 |
5 | 121323002242021320 |
6 | 2214324350323254 |
7 | 143632446530410 |
oct | 20231437127262 |
9 | 3862206513527 |
10 | 1120122220210 |
11 | 3a204a878954 |
12 | 1611067b952a |
13 | 8181c8a6556 |
14 | 3c2ddac62b0 |
15 | 1e20c3103aa |
hex | 104cc7caeb2 |
1120122220210 has 32 divisors (see below), whose sum is σ = 2308464028800. Its totient is φ = 383339803392.
The previous prime is 1120122220207. The next prime is 1120122220213. The reversal of 1120122220210 is 120222210211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1120122220207) and next prime (1120122220213).
It is not an unprimeable number, because it can be changed into a prime (1120122220213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14588535 + ... + 14665114.
It is an arithmetic number, because the mean of its divisors is an integer number (72139500900).
Almost surely, 21120122220210 is an apocalyptic number.
1120122220210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1120122220210 is an abundant number, since it is smaller than the sum of its proper divisors (1188341808590).
1120122220210 is a wasteful number, since it uses less digits than its factorization.
1120122220210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29254210.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1120122220210 its reverse (120222210211), we get a palindrome (1240344430421).
Subtracting from 1120122220210 its reverse (120222210211), we obtain a palindrome (999900009999).
The spelling of 1120122220210 in words is "one trillion, one hundred twenty billion, one hundred twenty-two million, two hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •