Base | Representation |
---|---|
bin | 1001011010110101000101… |
… | …11100101100010000010100 |
3 | 2201100011001012011120201220 |
4 | 10231122202330230100110 |
5 | 10203330324411321322 |
6 | 112015241243450340 |
7 | 4235320042030224 |
oct | 455324274542024 |
9 | 81304035146656 |
10 | 20713066120212 |
11 | 66663a8922194 |
12 | 23a63b7b269b0 |
13 | b7330673324b |
14 | 5187369c0084 |
15 | 25dbdb0a155c |
hex | 12d6a2f2c414 |
20713066120212 has 48 divisors (see below), whose sum is σ = 50980406937600. Its totient is φ = 6527312748000.
The previous prime is 20713066120211. The next prime is 20713066120213. The reversal of 20713066120212 is 21202166031702.
It is an interprime number because it is at equal distance from previous prime (20713066120211) and next prime (20713066120213).
It is a super-2 number, since 2×207130661202122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20713066120211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94720414 + ... + 94938837.
It is an arithmetic number, because the mean of its divisors is an integer number (1062091811200).
Almost surely, 220713066120212 is an apocalyptic number.
It is an amenable number.
20713066120212 is an abundant number, since it is smaller than the sum of its proper divisors (30267340817388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20713066120212 is a wasteful number, since it uses less digits than its factorization.
20713066120212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189659756 (or 189659754 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The spelling of 20713066120212 in words is "twenty trillion, seven hundred thirteen billion, sixty-six million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •