Base | Representation |
---|---|
bin | 1100001111001000010… |
… | …1101100101000100110 |
3 | 202002121121000222122010 |
4 | 3003302011230220212 |
5 | 11421012310310042 |
6 | 240323532215050 |
7 | 21121306413411 |
oct | 3036205545046 |
9 | 662547028563 |
10 | 210220010022 |
11 | 81176795a80 |
12 | 348aa30a486 |
13 | 16a9277b799 |
14 | a263554b78 |
15 | 57057e059c |
hex | 30f216ca26 |
210220010022 has 16 divisors (see below), whose sum is σ = 458661840192. Its totient is φ = 63703033320.
The previous prime is 210220010017. The next prime is 210220010029. The reversal of 210220010022 is 220010022012.
It is a super-2 number, since 2×2102200100222 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210220010029) 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, 1592575768 + ... + 1592575899.
It is an arithmetic number, because the mean of its divisors is an integer number (28666365012).
Almost surely, 2210220010022 is an apocalyptic number.
210220010022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210220010022 is an abundant number, since it is smaller than the sum of its proper divisors (248441830170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210220010022 is a wasteful number, since it uses less digits than its factorization.
210220010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3185151683.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 210220010022 its reverse (220010022012), we get a palindrome (430230032034).
The spelling of 210220010022 in words is "two hundred ten billion, two hundred twenty million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •