Base | Representation |
---|---|
bin | 1001011010110000101011… |
… | …11011000101000101111110 |
3 | 2201022220221022002211011200 |
4 | 10231120111323011011332 |
5 | 10203311003212011311 |
6 | 112014210404000330 |
7 | 4235204312210661 |
oct | 455302573050576 |
9 | 81286838084150 |
10 | 20710700110206 |
11 | 66653a4315917 |
12 | 23a5a576900a6 |
13 | b7301a4b8722 |
14 | 51859068b6d8 |
15 | 25daed4e1556 |
hex | 12d615ec517e |
20710700110206 has 24 divisors (see below), whose sum is σ = 45542932583304. Its totient is φ = 6800528394000.
The previous prime is 20710700110159. The next prime is 20710700110253. The reversal of 20710700110206 is 60201100701702.
It is an interprime number because it is at equal distance from previous prime (20710700110159) and next prime (20710700110253).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20710700110206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8586524545 + ... + 8586526956.
It is an arithmetic number, because the mean of its divisors is an integer number (1897622190971).
Almost surely, 220710700110206 is an apocalyptic number.
20710700110206 is an abundant number, since it is smaller than the sum of its proper divisors (24832232473098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20710700110206 is a wasteful number, since it uses less digits than its factorization.
20710700110206 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17173051576 (or 17173051573 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
Adding to 20710700110206 its reverse (60201100701702), we get a palindrome (80911800811908).
The spelling of 20710700110206 in words is "twenty trillion, seven hundred ten billion, seven hundred million, one hundred ten thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •