Base | Representation |
---|---|
bin | 10011000001001001… |
… | …10100101010011110 |
3 | 222100120021220121210 |
4 | 21200210310222132 |
5 | 131402302401342 |
6 | 4405052005250 |
7 | 511006161405 |
oct | 114044645236 |
9 | 28316256553 |
10 | 10210200222 |
11 | 436a434602 |
12 | 1b8b460826 |
13 | c694064c1 |
14 | 6cc03c63c |
15 | 3eb57e79c |
hex | 260934a9e |
10210200222 has 8 divisors (see below), whose sum is σ = 20420400456. Its totient is φ = 3403400072.
The previous prime is 10210200199. The next prime is 10210200229. The reversal of 10210200222 is 22200201201.
10210200222 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
10210200222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10210200198 and 10210200207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210200229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850850013 + ... + 850850024.
It is an arithmetic number, because the mean of its divisors is an integer number (2552550057).
Almost surely, 210210200222 is an apocalyptic number.
10210200222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210200222 is a wasteful number, since it uses less digits than its factorization.
10210200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1701700042.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10210200222 its reverse (22200201201), we get a palindrome (32410401423).
The spelling of 10210200222 in words is "ten billion, two hundred ten million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •