Base | Representation |
---|---|
bin | 111011101010110… |
… | …0001100100010101 |
3 | 12011112100210201012 |
4 | 1313111201210111 |
5 | 13100021144341 |
6 | 530400342005 |
7 | 100420556156 |
oct | 16725414425 |
9 | 5145323635 |
10 | 2002131221 |
11 | 938172902 |
12 | 47a614905 |
13 | 25ba4243c |
14 | 14dc9192d |
15 | bab840eb |
hex | 77561915 |
2002131221 has 2 divisors, whose sum is σ = 2002131222. Its totient is φ = 2002131220.
The previous prime is 2002131217. The next prime is 2002131227. The reversal of 2002131221 is 1221312002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1351371121 + 650760100 = 36761^2 + 25510^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002131221 - 22 = 2002131217 is a prime.
It is a super-2 number, since 2×20021312212 = 8017058852205901682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2002131196 and 2002131205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002131227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001065610 + 1001065611.
It is an arithmetic number, because the mean of its divisors is an integer number (1001065611).
Almost surely, 22002131221 is an apocalyptic number.
It is an amenable number.
2002131221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002131221 is an equidigital number, since it uses as much as digits as its factorization.
2002131221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2002131221 is about 44745.1809807492. The cubic root of 2002131221 is about 1260.3684193919.
Adding to 2002131221 its reverse (1221312002), we get a palindrome (3223443223).
The spelling of 2002131221 in words is "two billion, two million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •