Base | Representation |
---|---|
bin | 100000001101001000010… |
… | …011011001010010110101 |
3 | 21211120110012222121220020 |
4 | 200031020103121102311 |
5 | 242224433011420313 |
6 | 4412405511555353 |
7 | 315615130553250 |
oct | 40151023312265 |
9 | 7746405877806 |
10 | 2213121201333 |
11 | 783641249829 |
12 | 2b8b0198bb59 |
13 | 1309090acbb3 |
14 | 7918944a097 |
15 | 3c87d345323 |
hex | 203484d94b5 |
2213121201333 has 32 divisors (see below), whose sum is σ = 3393711360000. Its totient is φ = 1256656078656.
The previous prime is 2213121201331. The next prime is 2213121201341. The reversal of 2213121201333 is 3331021213122.
It is not a de Polignac number, because 2213121201333 - 21 = 2213121201331 is a prime.
It is a super-2 number, since 2×22131212013332 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2213121201331) 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 in 31 ways as a sum of consecutive naturals, for example, 2887818 + ... + 3572916.
It is an arithmetic number, because the mean of its divisors is an integer number (106053480000).
Almost surely, 22213121201333 is an apocalyptic number.
It is an amenable number.
2213121201333 is a deficient number, since it is larger than the sum of its proper divisors (1180590158667).
2213121201333 is a wasteful number, since it uses less digits than its factorization.
2213121201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686081.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 2213121201333 its reverse (3331021213122), we get a palindrome (5544142414455).
The spelling of 2213121201333 in words is "two trillion, two hundred thirteen billion, one hundred twenty-one million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •