Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …0001111010111110101 |
3 | 202021021001002121222022 |
4 | 3011131120033113311 |
5 | 11433204112024023 |
6 | 241222313042525 |
7 | 21214024355015 |
oct | 3053530172765 |
9 | 667231077868 |
10 | 212020033013 |
11 | 81a0a865988 |
12 | 351110b6445 |
13 | 16cbb679149 |
14 | a394635c45 |
15 | 57ad8507c8 |
hex | 315d60f5f5 |
212020033013 has 4 divisors (see below), whose sum is σ = 212021263788. Its totient is φ = 212018802240.
The previous prime is 212020032967. The next prime is 212020033063. The reversal of 212020033013 is 310330020212.
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 185169277969 + 26850755044 = 430313^2 + 163862^2 .
It is a cyclic number.
It is not a de Polignac number, because 212020033013 - 216 = 212019967477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212020032982 and 212020033000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212020033063) 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, 304706 + ... + 718947.
It is an arithmetic number, because the mean of its divisors is an integer number (53005315947).
Almost surely, 2212020033013 is an apocalyptic number.
It is an amenable number.
212020033013 is a deficient number, since it is larger than the sum of its proper divisors (1230775).
212020033013 is a wasteful number, since it uses less digits than its factorization.
212020033013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230774.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 212020033013 its reverse (310330020212), we get a palindrome (522350053225).
The spelling of 212020033013 in words is "two hundred twelve billion, twenty million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •