Base | Representation |
---|---|
bin | 10011101100001110… |
… | …100001101100111110 |
3 | 2000120111110202222000 |
4 | 103230032201230332 |
5 | 321300113201342 |
6 | 13414002003130 |
7 | 1345642246416 |
oct | 235416415476 |
9 | 60514422860 |
10 | 21143100222 |
11 | 8a6a802152 |
12 | 41209464a6 |
13 | 1cbc4692ba |
14 | 1048043646 |
15 | 83b2b744c |
hex | 4ec3a1b3e |
21143100222 has 16 divisors (see below), whose sum is σ = 46984667280. Its totient is φ = 7047700056.
The previous prime is 21143100203. The next prime is 21143100247. The reversal of 21143100222 is 22200134112.
It is a happy number.
21143100222 is a `hidden beast` number, since 2 + 11 + 431 + 0 + 0 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21143100195 and 21143100204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195769393 + ... + 195769500.
It is an arithmetic number, because the mean of its divisors is an integer number (2936541705).
Almost surely, 221143100222 is an apocalyptic number.
21143100222 is an abundant number, since it is smaller than the sum of its proper divisors (25841567058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21143100222 is a wasteful number, since it uses less digits than its factorization.
21143100222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391538904 (or 391538898 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 21143100222 its reverse (22200134112), we get a palindrome (43343234334).
The spelling of 21143100222 in words is "twenty-one billion, one hundred forty-three million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •