Base | Representation |
---|---|
bin | 100000001101001101000… |
… | …000011100101000001101 |
3 | 21211120122201111010102011 |
4 | 200031031000130220031 |
5 | 242230113212322313 |
6 | 4412421411301221 |
7 | 315620106424636 |
oct | 40151500345015 |
9 | 7746581433364 |
10 | 2213200120333 |
11 | 783681851844 |
12 | 2b8b242aa811 |
13 | 13091c552227 |
14 | 79195b1088d |
15 | 3c88523393d |
hex | 2034d01ca0d |
2213200120333 has 4 divisors (see below), whose sum is σ = 2213209962460. Its totient is φ = 2213190278208.
The previous prime is 2213200120331. The next prime is 2213200120337. The reversal of 2213200120333 is 3330210023122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 839023024324 + 1374177096009 = 915982^2 + 1172253^2 .
It is a cyclic number.
It is not a de Polignac number, because 2213200120333 - 21 = 2213200120331 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 (2213200120331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4575678 + ... + 5036191.
It is an arithmetic number, because the mean of its divisors is an integer number (553302490615).
Almost surely, 22213200120333 is an apocalyptic number.
It is an amenable number.
2213200120333 is a deficient number, since it is larger than the sum of its proper divisors (9842127).
2213200120333 is an equidigital number, since it uses as much as digits as its factorization.
2213200120333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9842126.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2213200120333 its reverse (3330210023122), we get a palindrome (5543410143455).
The spelling of 2213200120333 in words is "two trillion, two hundred thirteen billion, two hundred million, one hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •