Base | Representation |
---|---|
bin | 10010101010101111… |
… | …01100101010011000 |
3 | 221212110120000210101 |
4 | 21111113230222120 |
5 | 131011141211300 |
6 | 4334254425144 |
7 | 503234244502 |
oct | 112527545230 |
9 | 27773500711 |
10 | 10022210200 |
11 | 4283304952 |
12 | 1b385021b4 |
13 | c394958c2 |
14 | 6b10a4d72 |
15 | 3d9ce8b6a |
hex | 2555eca98 |
10022210200 has 48 divisors (see below), whose sum is σ = 23314914000. Its totient is φ = 4006600320.
The previous prime is 10022210197. The next prime is 10022210221. The reversal of 10022210200 is 201222001.
10022210200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 362466 + ... + 389134.
It is an arithmetic number, because the mean of its divisors is an integer number (485727375).
Almost surely, 210022210200 is an apocalyptic number.
10022210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10022210200 is an abundant number, since it is smaller than the sum of its proper divisors (13292703800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10022210200 is a wasteful number, since it uses less digits than its factorization.
10022210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28564 (or 28555 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10022210200 its reverse (201222001), we get a palindrome (10223432201).
The spelling of 10022210200 in words is "ten billion, twenty-two million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •