Base | Representation |
---|---|
bin | 1010111011000100110011… |
… | …1110011101100011100101 |
3 | 1120112010221221110221112102 |
4 | 2232301030332131203211 |
5 | 3033233010110031041 |
6 | 41313154345301445 |
7 | 2346460330432256 |
oct | 256611476354345 |
9 | 46463857427472 |
10 | 12010020002021 |
11 | 391046a210708 |
12 | 141b757494885 |
13 | 691703591372 |
14 | 2d740666ab2d |
15 | 15c61c93009b |
hex | aec4cf9d8e5 |
12010020002021 has 8 divisors (see below), whose sum is σ = 12052330452960. Its totient is φ = 11967782944752.
The previous prime is 12010020001999. The next prime is 12010020002047. The reversal of 12010020002021 is 12020002001021.
It is a happy number.
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 12010020002021 - 210 = 12010020000997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12010020001993 and 12010020002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010020002221) 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, 18020555 + ... + 18675128.
It is an arithmetic number, because the mean of its divisors is an integer number (1506541306620).
Almost surely, 212010020002021 is an apocalyptic number.
It is an amenable number.
12010020002021 is a deficient number, since it is larger than the sum of its proper divisors (42310450939).
12010020002021 is an equidigital number, since it uses as much as digits as its factorization.
12010020002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36696835.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12010020002021 its reverse (12020002001021), we get a palindrome (24030022003042).
The spelling of 12010020002021 in words is "twelve trillion, ten billion, twenty million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •