Base | Representation |
---|---|
bin | 10001100111000110010… |
… | …000011110111100110101 |
3 | 11021200202202102110220012 |
4 | 101213012100132330311 |
5 | 124312003234120041 |
6 | 2323544055350005 |
7 | 153302116304114 |
oct | 21470620367465 |
9 | 4250682373805 |
10 | 1210212020021 |
11 | 427280153964 |
12 | 176669682305 |
13 | 8a1791aa5c4 |
14 | 428088bbc7b |
15 | 217314c93eb |
hex | 119c641ef35 |
1210212020021 has 32 divisors (see below), whose sum is σ = 1254529140480. Its totient is φ = 1166901106176.
The previous prime is 1210212019997. The next prime is 1210212020027. The reversal of 1210212020021 is 1200202120121.
It is a cyclic number.
It is not a de Polignac number, because 1210212020021 - 26 = 1210212019957 is a prime.
It is a super-2 number, since 2×12102120200212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210212019978 and 1210212020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210212020027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 566312465 + ... + 566314601.
It is an arithmetic number, because the mean of its divisors is an integer number (39204035640).
Almost surely, 21210212020021 is an apocalyptic number.
It is an amenable number.
1210212020021 is a deficient number, since it is larger than the sum of its proper divisors (44317120459).
1210212020021 is a wasteful number, since it uses less digits than its factorization.
1210212020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3053.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1210212020021 its reverse (1200202120121), we get a palindrome (2410414140142).
The spelling of 1210212020021 in words is "one trillion, two hundred ten billion, two hundred twelve million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •