Base | Representation |
---|---|
bin | 1100001111001000011… |
… | …0000010100110110110 |
3 | 202002121121012120002110 |
4 | 3003302012002212312 |
5 | 11421012321200042 |
6 | 240323534151450 |
7 | 21121310236662 |
oct | 3036206024666 |
9 | 662547176073 |
10 | 210220100022 |
11 | 81176847659 |
12 | 348aa352586 |
13 | 16a927b073a |
14 | a2635798a2 |
15 | 570580c09c |
hex | 30f21829b6 |
210220100022 has 16 divisors (see below), whose sum is σ = 424774636272. Its totient is φ = 69350960640.
The previous prime is 210220100021. The next prime is 210220100087. The reversal of 210220100022 is 220001022012.
210220100022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 210220099980 and 210220100007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210220100021) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 180600879 + ... + 180602042.
It is an arithmetic number, because the mean of its divisors is an integer number (26548414767).
Almost surely, 2210220100022 is an apocalyptic number.
210220100022 is an abundant number, since it is smaller than the sum of its proper divisors (214554536250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210220100022 is a wasteful number, since it uses less digits than its factorization.
210220100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361203023.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 210220100022 its reverse (220001022012), we get a palindrome (430221122034).
The spelling of 210220100022 in words is "two hundred ten billion, two hundred twenty million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •