Base | Representation |
---|---|
bin | 10010101001010011… |
… | …000010110101010111 |
3 | 1220200020120002120110 |
4 | 102221103002311113 |
5 | 312000133223111 |
6 | 13110330334103 |
7 | 1306055662122 |
oct | 225123026527 |
9 | 56606502513 |
10 | 20020211031 |
11 | 8543983957 |
12 | 3a6888a333 |
13 | 1b70933122 |
14 | d7cc673b9 |
15 | 7c290e5a6 |
hex | 4a94c2d57 |
20020211031 has 4 divisors (see below), whose sum is σ = 26693614712. Its totient is φ = 13346807352.
The previous prime is 20020211021. The next prime is 20020211051. The reversal of 20020211031 is 13011202002.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 20020211031 - 29 = 20020210519 is a prime.
It is a super-2 number, since 2×200202110312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020210998 and 20020211016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020211021) 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 3 ways as a sum of consecutive naturals, for example, 3336701836 + ... + 3336701841.
It is an arithmetic number, because the mean of its divisors is an integer number (6673403678).
Almost surely, 220020211031 is an apocalyptic number.
20020211031 is a deficient number, since it is larger than the sum of its proper divisors (6673403681).
20020211031 is an equidigital number, since it uses as much as digits as its factorization.
20020211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6673403680.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20020211031 its reverse (13011202002), we get a palindrome (33031413033).
The spelling of 20020211031 in words is "twenty billion, twenty million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •