Base | Representation |
---|---|
bin | 111111001111011… |
… | …0011001100001101 |
3 | 12110212220221011121 |
4 | 1332132303030031 |
5 | 13321213100323 |
6 | 550321520541 |
7 | 103404505201 |
oct | 17636631415 |
9 | 5425827147 |
10 | 2122003213 |
11 | 9998a7470 |
12 | 4b27a3151 |
13 | 27a823005 |
14 | 161b76b01 |
15 | c6461a5d |
hex | 7e7b330d |
2122003213 has 4 divisors (see below), whose sum is σ = 2314912608. Its totient is φ = 1929093820.
The previous prime is 2122003211. The next prime is 2122003217. The reversal of 2122003213 is 3123002212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2122003213 - 21 = 2122003211 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 (2122003211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96454681 + ... + 96454702.
It is an arithmetic number, because the mean of its divisors is an integer number (578728152).
Almost surely, 22122003213 is an apocalyptic number.
It is an amenable number.
2122003213 is a deficient number, since it is larger than the sum of its proper divisors (192909395).
2122003213 is a wasteful number, since it uses less digits than its factorization.
2122003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192909394.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2122003213 is about 46065.2060996149. The cubic root of 2122003213 is about 1285.0361515363.
Adding to 2122003213 its reverse (3123002212), we get a palindrome (5245005425).
The spelling of 2122003213 in words is "two billion, one hundred twenty-two million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •