Base | Representation |
---|---|
bin | 10011010101100110… |
… | …101000000111011101 |
3 | 1222121001021012221101 |
4 | 103111212220013131 |
5 | 320010431320411 |
6 | 13312202433101 |
7 | 1333353123550 |
oct | 232546500735 |
9 | 58531235841 |
10 | 20763541981 |
11 | 8895529456 |
12 | 4035802791 |
13 | 1c5b934220 |
14 | 100d880697 |
15 | 817ce08c1 |
hex | 4d59a81dd |
20763541981 has 32 divisors (see below), whose sum is σ = 27018118400. Its totient is φ = 15495686208.
The previous prime is 20763541951. The next prime is 20763542047. The reversal of 20763541981 is 18914536702.
It is not a de Polignac number, because 20763541981 - 27 = 20763541853 is a prime.
It is a super-2 number, since 2×207635419812 (a number of 21 digits) contains 22 as substring.
It is a taxicab number since it can be written as a sum of two cubes in more than one way. Here 20763541981 = 2293 + 27483 = 20613 + 22903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20763541951) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90670375 + ... + 90670603.
It is an arithmetic number, because the mean of its divisors is an integer number (844316200).
It is a 2-persistent number, because it is pandigital, and so is 2⋅20763541981 = 41527083962, but 3⋅20763541981 = 62290625943 is not.
Almost surely, 220763541981 is an apocalyptic number.
It is an amenable number.
20763541981 is a deficient number, since it is larger than the sum of its proper divisors (6254576419).
20763541981 is an frugal number, since it uses more digits than its factorization.
20763541981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726 (or 268 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 20763541981 in words is "twenty billion, seven hundred sixty-three million, five hundred forty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •