Base | Representation |
---|---|
bin | 10011000110100011… |
… | …010011110110111011 |
3 | 1221221110002111010110 |
4 | 103012203103312323 |
5 | 314001304424311 |
6 | 13231142115403 |
7 | 1324165513413 |
oct | 230643236673 |
9 | 57843074113 |
10 | 20511014331 |
11 | 8775a29715 |
12 | 3b8511bb63 |
13 | 1c1b518192 |
14 | dc8107643 |
15 | 800a5c8a6 |
hex | 4c68d3dbb |
20511014331 has 8 divisors (see below), whose sum is σ = 27349148160. Its totient is φ = 13673445032.
The previous prime is 20511014323. The next prime is 20511014339. The reversal of 20511014331 is 13341011502.
It is an interprime number because it is at equal distance from previous prime (20511014323) and next prime (20511014339).
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 20511014331 - 23 = 20511014323 is a prime.
It is a super-2 number, since 2×205110143312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20511014298 and 20511014307.
It is not an unprimeable number, because it can be changed into a prime (20511014339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47475 + ... + 208028.
It is an arithmetic number, because the mean of its divisors is an integer number (3418643520).
Almost surely, 220511014331 is an apocalyptic number.
20511014331 is a deficient number, since it is larger than the sum of its proper divisors (6838133829).
20511014331 is a wasteful number, since it uses less digits than its factorization.
20511014331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282265.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 20511014331 its reverse (13341011502), we get a palindrome (33852025833).
The spelling of 20511014331 in words is "twenty billion, five hundred eleven million, fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •