Base | Representation |
---|---|
bin | 100000001010001110010… |
… | …001101110101000101001 |
3 | 21211021101201021110001202 |
4 | 200022032101232220221 |
5 | 242202040022433111 |
6 | 4411132102053545 |
7 | 315444602525534 |
oct | 40121621565051 |
9 | 7737351243052 |
10 | 2210000202281 |
11 | 78228a554a73 |
12 | 2b839071a2b5 |
13 | 13052c611ab1 |
14 | 78d70b47a1b |
15 | 3c74934eb3b |
hex | 2028e46ea29 |
2210000202281 has 2 divisors, whose sum is σ = 2210000202282. Its totient is φ = 2210000202280.
The previous prime is 2210000202211. The next prime is 2210000202329. The reversal of 2210000202281 is 1822020000122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1959955200256 + 250045002025 = 1399984^2 + 500045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2210000202281 is a prime.
It is a super-2 number, since 2×22100002022812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2210000202211) 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 as a sum of consecutive naturals, namely, 1105000101140 + 1105000101141.
It is an arithmetic number, because the mean of its divisors is an integer number (1105000101141).
Almost surely, 22210000202281 is an apocalyptic number.
It is an amenable number.
2210000202281 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210000202281 is an equidigital number, since it uses as much as digits as its factorization.
2210000202281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
The spelling of 2210000202281 in words is "two trillion, two hundred ten billion, two hundred two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •