Base | Representation |
---|---|
bin | 110000001101010011000010… |
… | …000010011001111001011011 |
3 | 1000210200220201210202211221011 |
4 | 300031103002002121321123 |
5 | 210242214000334310021 |
6 | 2030532353015154351 |
7 | 62441640525160564 |
oct | 6015230202317133 |
9 | 1023626653684834 |
10 | 212020021010011 |
11 | 61613205567315 |
12 | 1b942a980759b7 |
13 | 913c52c801446 |
14 | 3a4db765d716b |
15 | 197a1d99cade1 |
hex | c0d4c2099e5b |
212020021010011 has 8 divisors (see below), whose sum is σ = 213145512505344. Its totient is φ = 210894690338280.
The previous prime is 212020021010003. The next prime is 212020021010027. The reversal of 212020021010011 is 110010120020212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212020021010011 - 23 = 212020021010003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212020021009973 and 212020021010000.
It is not an unprimeable number, because it can be changed into a prime (212020021110011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37561765 + ... + 42836038.
It is an arithmetic number, because the mean of its divisors is an integer number (26643189063168).
Almost surely, 2212020021010011 is an apocalyptic number.
212020021010011 is a deficient number, since it is larger than the sum of its proper divisors (1125491495333).
212020021010011 is a wasteful number, since it uses less digits than its factorization.
212020021010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80411801.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 212020021010011 its reverse (110010120020212), we get a palindrome (322030141030223).
The spelling of 212020021010011 in words is "two hundred twelve trillion, twenty billion, twenty-one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •