Base | Representation |
---|---|
bin | 100000010100110001100… |
… | …101100001000001100101 |
3 | 21212100122022022022201202 |
4 | 200110301211201001211 |
5 | 242343240440311323 |
6 | 4420244231132245 |
7 | 316325425356536 |
oct | 40246145410145 |
9 | 7770568268652 |
10 | 2221330010213 |
11 | 7870739763a6 |
12 | 2ba612b14085 |
13 | 131616972962 |
14 | 7972774a68d |
15 | 3cbadd39d28 |
hex | 20531961065 |
2221330010213 has 8 divisors (see below), whose sum is σ = 2372810611608. Its totient is φ = 2072162089984.
The previous prime is 2221330010201. The next prime is 2221330010231. The reversal of 2221330010213 is 3120100331222.
It can be written as a sum of positive squares in 4 ways, for example, as 31888609 + 2221298121604 = 5647^2 + 1490402^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2221330010213 - 220 = 2221328961637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2221330015213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 578168306 + ... + 578172147.
It is an arithmetic number, because the mean of its divisors is an integer number (296601326451).
Almost surely, 22221330010213 is an apocalyptic number.
It is an amenable number.
2221330010213 is a deficient number, since it is larger than the sum of its proper divisors (151480601395).
2221330010213 is a wasteful number, since it uses less digits than its factorization.
2221330010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156340583.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2221330010213 its reverse (3120100331222), we get a palindrome (5341430341435).
The spelling of 2221330010213 in words is "two trillion, two hundred twenty-one billion, three hundred thirty million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •