Base | Representation |
---|---|
bin | 10100100101010001… |
… | …100100101100010101 |
3 | 2010001012102111022211 |
4 | 110211101210230111 |
5 | 330230122401323 |
6 | 14052551553421 |
7 | 1411443413410 |
oct | 244521445425 |
9 | 63035374284 |
10 | 22100200213 |
11 | 9410a94583 |
12 | 434938b871 |
13 | 2112835960 |
14 | 10d91c4b77 |
15 | 89532270d |
hex | 525464b15 |
22100200213 has 8 divisors (see below), whose sum is σ = 27200246528. Its totient is φ = 17485872624.
The previous prime is 22100200211. The next prime is 22100200247. The reversal of 22100200213 is 31200200122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22100200213 - 21 = 22100200211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 22100200193 and 22100200202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22100200211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121429581 + ... + 121429762.
It is an arithmetic number, because the mean of its divisors is an integer number (3400030816).
Almost surely, 222100200213 is an apocalyptic number.
It is an amenable number.
22100200213 is a deficient number, since it is larger than the sum of its proper divisors (5100046315).
22100200213 is a wasteful number, since it uses less digits than its factorization.
22100200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242859363.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 22100200213 its reverse (31200200122), we get a palindrome (53300400335).
Subtracting 22100200213 from its reverse (31200200122), we obtain a palindrome (9099999909).
The spelling of 22100200213 in words is "twenty-two billion, one hundred million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •