Base | Representation |
---|---|
bin | 1001001100001101101001… |
… | …11011011111000001001011 |
3 | 2122120010202100101122011011 |
4 | 10212012310323133001023 |
5 | 10122113313243320412 |
6 | 110552423411144351 |
7 | 4154120603513356 |
oct | 446066473370113 |
9 | 78503670348134 |
10 | 20210856620107 |
11 | 649241573664a |
12 | 2324bbaba50b7 |
13 | b37b4c90897a |
14 | 4dc2d416929d |
15 | 250ae64c67a7 |
hex | 1261b4edf04b |
20210856620107 has 8 divisors (see below), whose sum is σ = 20757153415376. Its totient is φ = 19664562847392.
The previous prime is 20210856620083. The next prime is 20210856620147. The reversal of 20210856620107 is 70102665801202.
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 20210856620107 - 223 = 20210848231499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20210856620107.
It is not an unprimeable number, because it can be changed into a prime (20210856620147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21683893 + ... + 22596745.
It is an arithmetic number, because the mean of its divisors is an integer number (2594644176922).
Almost surely, 220210856620107 is an apocalyptic number.
20210856620107 is a deficient number, since it is larger than the sum of its proper divisors (546296795269).
20210856620107 is an equidigital number, since it uses as much as digits as its factorization.
20210856620107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1511277.
The product of its (nonzero) digits is 80640, while the sum is 40.
The spelling of 20210856620107 in words is "twenty trillion, two hundred ten billion, eight hundred fifty-six million, six hundred twenty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •