Base | Representation |
---|---|
bin | 10010110100001101… |
… | …100011010000001011 |
3 | 1221011000010000022101 |
4 | 102310031203100023 |
5 | 312334022222311 |
6 | 13140431134231 |
7 | 1313441250355 |
oct | 226415432013 |
9 | 57130100271 |
10 | 20203320331 |
11 | 862827a657 |
12 | 3aba074377 |
13 | 1b9c85531c |
14 | d992d00d5 |
15 | 7d3a2dec1 |
hex | 4b436340b |
20203320331 has 8 divisors (see below), whose sum is σ = 21271643280. Its totient is φ = 19135496448.
The previous prime is 20203320329. The next prime is 20203320391. The reversal of 20203320331 is 13302330202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20203320331 - 21 = 20203320329 is a prime.
It is a super-2 number, since 2×202033203312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20203320299 and 20203320308.
It is not an unprimeable number, because it can be changed into a prime (20203320301) 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, 40186 + ... + 204991.
It is an arithmetic number, because the mean of its divisors is an integer number (2658955410).
Almost surely, 220203320331 is an apocalyptic number.
20203320331 is a deficient number, since it is larger than the sum of its proper divisors (1068322949).
20203320331 is a wasteful number, since it uses less digits than its factorization.
20203320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249533.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 20203320331 its reverse (13302330202), we get a palindrome (33505650533).
The spelling of 20203320331 in words is "twenty billion, two hundred three million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •