Base | Representation |
---|---|
bin | 1100001011101… |
… | …11101101101101 |
3 | 21010022102002110 |
4 | 12011313231231 |
5 | 202130432341 |
6 | 14050314233 |
7 | 2350463442 |
oct | 605675555 |
9 | 233272073 |
10 | 102202221 |
11 | 52766050 |
12 | 2a288979 |
13 | 18234cb4 |
14 | d8059c9 |
15 | 8e8c216 |
hex | 6177b6d |
102202221 has 32 divisors (see below), whose sum is σ = 152064000. Its totient is φ = 60540480.
The previous prime is 102202211. The next prime is 102202223. The reversal of 102202221 is 122202201.
It is not a de Polignac number, because 102202221 - 25 = 102202189 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102202197 and 102202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 513480 + ... + 513678.
It is an arithmetic number, because the mean of its divisors is an integer number (4752000).
Almost surely, 2102202221 is an apocalyptic number.
102202221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102202221 is a deficient number, since it is larger than the sum of its proper divisors (49861779).
102202221 is a wasteful number, since it uses less digits than its factorization.
102202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489.
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 102202221 is about 10109.5114125263. The cubic root of 102202221 is about 467.5414412252.
Adding to 102202221 its reverse (122202201), we get a palindrome (224404422).
The spelling of 102202221 in words is "one hundred two million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •