Base | Representation |
---|---|
bin | 10010101001011010… |
… | …101001001010010111 |
3 | 1220200101022022002020 |
4 | 102221122221022113 |
5 | 312001140444111 |
6 | 13110441144223 |
7 | 1306111626525 |
oct | 225132511227 |
9 | 56611268066 |
10 | 20022203031 |
11 | 8545014536 |
12 | 3a6948b073 |
13 | 1b7117ca1c |
14 | d7d225315 |
15 | 7c2ba4906 |
hex | 4a96a9297 |
20022203031 has 8 divisors (see below), whose sum is σ = 26696962800. Its totient is φ = 13347789312.
The previous prime is 20022203023. The next prime is 20022203099. The reversal of 20022203031 is 13030222002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20022203031 - 23 = 20022203023 is a prime.
It is a super-2 number, since 2×200222030312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20022203031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022203231) 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, 116661 + ... + 231633.
It is an arithmetic number, because the mean of its divisors is an integer number (3337120350).
Almost surely, 220022203031 is an apocalyptic number.
20022203031 is a deficient number, since it is larger than the sum of its proper divisors (6674759769).
20022203031 is a wasteful number, since it uses less digits than its factorization.
20022203031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173025.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 20022203031 its reverse (13030222002), we get a palindrome (33052425033).
The spelling of 20022203031 in words is "twenty billion, twenty-two million, two hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •