Base | Representation |
---|---|
bin | 1001000111010111001111… |
… | …0101110110111110001000 |
3 | 1022111002210112102100121210 |
4 | 2101311303311312332020 |
5 | 2303200231130401300 |
6 | 33152031251533120 |
7 | 2053034015060616 |
oct | 221656365667610 |
9 | 38432715370553 |
10 | 10022102200200 |
11 | 3214393464182 |
12 | 115a4258ba1a0 |
13 | 5791072115ac |
14 | 2691026b46b6 |
15 | 125a7050d050 |
hex | 91d73d76f88 |
10022102200200 has 48 divisors (see below), whose sum is σ = 31068516822480. Its totient is φ = 2672560586560.
The previous prime is 10022102200199. The next prime is 10022102200261. The reversal of 10022102200200 is 200220122001.
It is a super-2 number, since 2×100221022002002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8351751234 + ... + 8351752433.
It is an arithmetic number, because the mean of its divisors is an integer number (647260767135).
Almost surely, 210022102200200 is an apocalyptic number.
10022102200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10022102200200 is an abundant number, since it is smaller than the sum of its proper divisors (21046414622280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10022102200200 is a wasteful number, since it uses less digits than its factorization.
10022102200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16703503686 (or 16703503677 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10022102200200 its reverse (200220122001), we get a palindrome (10222322322201).
The spelling of 10022102200200 in words is "ten trillion, twenty-two billion, one hundred two million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •