Base | Representation |
---|---|
bin | 1001010111111011011001… |
… | …00010001100111110100001 |
3 | 2200222121201010101001001012 |
4 | 10223331230202030332201 |
5 | 10200212134423141011 |
6 | 111501352335350305 |
7 | 4225160333113256 |
oct | 453755442147641 |
9 | 80877633331035 |
10 | 20613368958881 |
11 | 662809842a286 |
12 | 238b013682395 |
13 | b66aa88a66aa |
14 | 513999c7142d |
15 | 25b303736a8b |
hex | 12bf6c88cfa1 |
20613368958881 has 4 divisors (see below), whose sum is σ = 20613945640752. Its totient is φ = 20612792277012.
The previous prime is 20613368958857. The next prime is 20613368958907. The reversal of 20613368958881 is 18885986331602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20613368958881 - 214 = 20613368942497 is a prime.
It is a super-2 number, since 2×206133689588812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20613368958781) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288287315 + ... + 288358808.
It is an arithmetic number, because the mean of its divisors is an integer number (5153486410188).
Almost surely, 220613368958881 is an apocalyptic number.
It is an amenable number.
20613368958881 is a deficient number, since it is larger than the sum of its proper divisors (576681871).
20613368958881 is an equidigital number, since it uses as much as digits as its factorization.
20613368958881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576681870.
The product of its (nonzero) digits is 119439360, while the sum is 68.
The spelling of 20613368958881 in words is "twenty trillion, six hundred thirteen billion, three hundred sixty-eight million, nine hundred fifty-eight thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •