Base | Representation |
---|---|
bin | 1000010001010010… |
… | …1010101010001010 |
3 | 12201201100012101010 |
4 | 2010110222222022 |
5 | 14021310310442 |
6 | 1004142304350 |
7 | 106004526501 |
oct | 20424525212 |
9 | 5651305333 |
10 | 2220010122 |
11 | a3a157510 |
12 | 51b5880b6 |
13 | 294c19575 |
14 | 170ba9838 |
15 | ced70b9c |
hex | 8452aa8a |
2220010122 has 64 divisors (see below), whose sum is σ = 5130339840. Its totient is φ = 633355200.
The previous prime is 2220010109. The next prime is 2220010147. The reversal of 2220010122 is 2210100222.
It is a junction number, because it is equal to n+sod(n) for n = 2220010098 and 2220010107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 198972 + ... + 209832.
It is an arithmetic number, because the mean of its divisors is an integer number (80161560).
Almost surely, 22220010122 is an apocalyptic number.
2220010122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2220010122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2565169920).
2220010122 is an abundant number, since it is smaller than the sum of its proper divisors (2910329718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2220010122 is a wasteful number, since it uses less digits than its factorization.
2220010122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11059.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 2220010122 is about 47116.9833711794. The cubic root of 2220010122 is about 1304.5227326539.
Adding to 2220010122 its reverse (2210100222), we get a palindrome (4430110344).
The spelling of 2220010122 in words is "two billion, two hundred twenty million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •