Base | Representation |
---|---|
bin | 1100010101110001001… |
… | …1011101100101110001 |
3 | 202021012210011121212122 |
4 | 3011130103131211301 |
5 | 11433140003101223 |
6 | 241220430404025 |
7 | 21213415203212 |
oct | 3053423354561 |
9 | 667183147778 |
10 | 212002003313 |
11 | 81a00670a01 |
12 | 35107060615 |
13 | 16cb7a05799 |
14 | a3920a1409 |
15 | 57abe8d5c8 |
hex | 315c4dd971 |
212002003313 has 4 divisors (see below), whose sum is σ = 213424835700. Its totient is φ = 210579170928.
The previous prime is 212002003271. The next prime is 212002003319. The reversal of 212002003313 is 313300200212.
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 88722366769 + 123279636544 = 297863^2 + 351112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212002003313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212002003291 and 212002003300.
It is not an unprimeable number, because it can be changed into a prime (212002003319) 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, 711415970 + ... + 711416267.
It is an arithmetic number, because the mean of its divisors is an integer number (53356208925).
Almost surely, 2212002003313 is an apocalyptic number.
It is an amenable number.
212002003313 is a deficient number, since it is larger than the sum of its proper divisors (1422832387).
212002003313 is a wasteful number, since it uses less digits than its factorization.
212002003313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1422832386.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 212002003313 its reverse (313300200212), we get a palindrome (525302203525).
The spelling of 212002003313 in words is "two hundred twelve billion, two million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •