Base | Representation |
---|---|
bin | 10011000001011001… |
… | …00100110000011100 |
3 | 222100201010010222222 |
4 | 21200230210300130 |
5 | 131403312412340 |
6 | 4405203324512 |
7 | 511032353531 |
oct | 114054446034 |
9 | 28321103888 |
10 | 10212232220 |
11 | 43705a2243 |
12 | 1b90080738 |
13 | c69968378 |
14 | 6cc40ad88 |
15 | 3eb8318b5 |
hex | 260b24c1c |
10212232220 has 48 divisors (see below), whose sum is σ = 21559425888. Its totient is φ = 4063288320.
The previous prime is 10212232213. The next prime is 10212232229. The reversal of 10212232220 is 2223221201.
It is a super-2 number, since 2×102122322202 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212232229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3573032 + ... + 3575888.
It is an arithmetic number, because the mean of its divisors is an integer number (449154706).
Almost surely, 210212232220 is an apocalyptic number.
10212232220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10212232220 is an abundant number, since it is smaller than the sum of its proper divisors (11347193668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212232220 is a wasteful number, since it uses less digits than its factorization.
10212232220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3750 (or 3748 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 10212232220 its reverse (2223221201), we get a palindrome (12435453421).
The spelling of 10212232220 in words is "ten billion, two hundred twelve million, two hundred thirty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.559 sec. • engine limits •