Base | Representation |
---|---|
bin | 11000000110110… |
… | …10010111010010 |
3 | 112002111220002001 |
4 | 30003122113102 |
5 | 403232033020 |
6 | 32022144214 |
7 | 5003564425 |
oct | 1403322722 |
9 | 462456061 |
10 | 202221010 |
11 | a416a702 |
12 | 5788206a |
13 | 32b84204 |
14 | 1cbdd9bc |
15 | 12b4750a |
hex | c0da5d2 |
202221010 has 8 divisors (see below), whose sum is σ = 363997836. Its totient is φ = 80888400.
The previous prime is 202220999. The next prime is 202221011. The reversal of 202221010 is 10122202.
It can be written as a sum of positive squares in 2 ways, for example, as 188210961 + 14010049 = 13719^2 + 3743^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 20222101 = 202221010 / (2 + 0 + 2 + 2 + 2 + 1 + 0 + 1 + 0).
It is not an unprimeable number, because it can be changed into a prime (202221011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10111041 + ... + 10111060.
Almost surely, 2202221010 is an apocalyptic number.
202221010 is a deficient number, since it is larger than the sum of its proper divisors (161776826).
202221010 is a wasteful number, since it uses less digits than its factorization.
202221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20222108.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 202221010 is about 14220.4433826797. The cubic root of 202221010 is about 586.9603410157.
Adding to 202221010 its reverse (10122202), we get a palindrome (212343212).
It can be divided in two parts, 2022 and 21010, that added together give a palindrome (23032).
The spelling of 202221010 in words is "two hundred two million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •