Base | Representation |
---|---|
bin | 1011110001010011000… |
… | …1111111011101011101 |
3 | 201022221111202121222200 |
4 | 2330110301333131131 |
5 | 11303112300042341 |
6 | 232521151202113 |
7 | 20416001410530 |
oct | 2742461773535 |
9 | 638844677880 |
10 | 202212112221 |
11 | 78837513919 |
12 | 33234516339 |
13 | 160b7701912 |
14 | 9b03bd2a17 |
15 | 53d7784db6 |
hex | 2f14c7f75d |
202212112221 has 24 divisors (see below), whose sum is σ = 337115535744. Its totient is φ = 114405717600.
The previous prime is 202212112181. The next prime is 202212112243. The reversal of 202212112221 is 122211212202.
It is a happy number.
It is not a de Polignac number, because 202212112221 - 211 = 202212110173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202212112194 and 202212112203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202212102221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15883321 + ... + 15896046.
It is an arithmetic number, because the mean of its divisors is an integer number (14046480656).
Almost surely, 2202212112221 is an apocalyptic number.
202212112221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
202212112221 is a deficient number, since it is larger than the sum of its proper divisors (134903423523).
202212112221 is a wasteful number, since it uses less digits than its factorization.
202212112221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31779481 (or 31779478 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 202212112221 its reverse (122211212202), we get a palindrome (324423324423).
The spelling of 202212112221 in words is "two hundred two billion, two hundred twelve million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •