Base | Representation |
---|---|
bin | 1001100011110000110100… |
… | …01110101101110101101100 |
3 | 2202102111022122020212021210 |
4 | 10301320122032231311230 |
5 | 10223342440030341022 |
6 | 112412243112354420 |
7 | 4266434305044234 |
oct | 461703216556554 |
9 | 82374278225253 |
10 | 21020010012012 |
11 | 6774599730140 |
12 | 243599a9a5a10 |
13 | b9624205136b |
14 | 529534034cc4 |
15 | 266ba3194a0c |
hex | 131e1a3add6c |
21020010012012 has 24 divisors (see below), whose sum is σ = 53505480030912. Its totient is φ = 6369700003600.
The previous prime is 21020010011993. The next prime is 21020010012013. The reversal of 21020010012012 is 21021001002012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (21020010012013) 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, 79621249914 + ... + 79621250177.
It is an arithmetic number, because the mean of its divisors is an integer number (2229395001288).
Almost surely, 221020010012012 is an apocalyptic number.
21020010012012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21020010012012 is an abundant number, since it is smaller than the sum of its proper divisors (32485470018900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21020010012012 is a wasteful number, since it uses less digits than its factorization.
21020010012012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159242500109 (or 159242500107 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21020010012012 its reverse (21021001002012), we get a palindrome (42041011014024).
The spelling of 21020010012012 in words is "twenty-one trillion, twenty billion, ten million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •