Base | Representation |
---|---|
bin | 10010101001010011… |
… | …100000001011011111 |
3 | 1220200020210012110022 |
4 | 102221103200023133 |
5 | 312000201044411 |
6 | 13110333102355 |
7 | 1306060002425 |
oct | 225123401337 |
9 | 56606705408 |
10 | 20020331231 |
11 | 8543a5619a |
12 | 3a689279bb |
13 | 1b70975a54 |
14 | d7cc99115 |
15 | 7c2934edb |
hex | 4a94e02df |
20020331231 has 8 divisors (see below), whose sum is σ = 21276224064. Its totient is φ = 18773130240.
The previous prime is 20020331203. The next prime is 20020331269. The reversal of 20020331231 is 13213302002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20020331231 is a prime.
It is a super-2 number, since 2×200203312312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020331831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2168210 + ... + 2177423.
It is an arithmetic number, because the mean of its divisors is an integer number (2659528008).
Almost surely, 220020331231 is an apocalyptic number.
20020331231 is a deficient number, since it is larger than the sum of its proper divisors (1255892833).
20020331231 is a wasteful number, since it uses less digits than its factorization.
20020331231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4345921.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20020331231 its reverse (13213302002), we get a palindrome (33233633233).
The spelling of 20020331231 in words is "twenty billion, twenty million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •