Base | Representation |
---|---|
bin | 1000001101000001… |
… | …1011010000001010 |
3 | 12200110200100102102 |
4 | 2003100123100022 |
5 | 14002220334401 |
6 | 1002303033402 |
7 | 105366502334 |
oct | 20320332012 |
9 | 5613610372 |
10 | 2202121226 |
11 | a300492a8 |
12 | 51559b862 |
13 | 2912c5016 |
14 | 16c670454 |
15 | cd4da56b |
hex | 8341b40a |
2202121226 has 4 divisors (see below), whose sum is σ = 3303181842. Its totient is φ = 1101060612.
The previous prime is 2202121211. The next prime is 2202121241. The reversal of 2202121226 is 6221212022.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 6221212022 = 2 ⋅3110606011.
It is an interprime number because it is at equal distance from previous prime (2202121211) and next prime (2202121241).
It can be written as a sum of positive squares in only one way, i.e., 1940490601 + 261630625 = 44051^2 + 16175^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2202121198 and 2202121207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550530305 + ... + 550530308.
Almost surely, 22202121226 is an apocalyptic number.
2202121226 is a deficient number, since it is larger than the sum of its proper divisors (1101060616).
2202121226 is a wasteful number, since it uses less digits than its factorization.
2202121226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101060615.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 2202121226 is about 46926.7644953282. The cubic root of 2202121226 is about 1301.0093199088.
Adding to 2202121226 its reverse (6221212022), we get a palindrome (8423333248).
The spelling of 2202121226 in words is "two billion, two hundred two million, one hundred twenty-one thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •