Base | Representation |
---|---|
bin | 100000001010100010000… |
… | …111101101100111110101 |
3 | 21211022020220201110201011 |
4 | 200022202013231213311 |
5 | 242203230234333023 |
6 | 4411225113432221 |
7 | 315456054351223 |
oct | 40124207554765 |
9 | 7738226643634 |
10 | 2210333121013 |
11 | 782440472816 |
12 | 2b846410b671 |
13 | 130583597224 |
14 | 78da3049b13 |
15 | 3c7686b250d |
hex | 202a21ed9f5 |
2210333121013 has 4 divisors (see below), whose sum is σ = 2211817563820. Its totient is φ = 2208848678208.
The previous prime is 2210333121011. The next prime is 2210333121053. The reversal of 2210333121013 is 3101213330122.
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 559357401604 + 1650975719409 = 747902^2 + 1284903^2 .
It is a cyclic number.
It is not a de Polignac number, because 2210333121013 - 21 = 2210333121011 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 (2210333121011) 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, 742219170 + ... + 742222147.
It is an arithmetic number, because the mean of its divisors is an integer number (552954390955).
Almost surely, 22210333121013 is an apocalyptic number.
It is an amenable number.
2210333121013 is a deficient number, since it is larger than the sum of its proper divisors (1484442807).
2210333121013 is a wasteful number, since it uses less digits than its factorization.
2210333121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1484442806.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2210333121013 its reverse (3101213330122), we get a palindrome (5311546451135).
The spelling of 2210333121013 in words is "two trillion, two hundred ten billion, three hundred thirty-three million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •