Base | Representation |
---|---|
bin | 10010110101010001… |
… | …000100011101111111 |
3 | 1221012020102020201211 |
4 | 102311101010131333 |
5 | 312403040120111 |
6 | 13142302345251 |
7 | 1314044556112 |
oct | 226521043577 |
9 | 57166366654 |
10 | 20221020031 |
11 | 8637269703 |
12 | 3b03b8b227 |
13 | 1ba3411714 |
14 | d9b7ba579 |
15 | 7d5378521 |
hex | 4b544477f |
20221020031 has 4 divisors (see below), whose sum is σ = 20221524064. Its totient is φ = 20220516000.
The previous prime is 20221019993. The next prime is 20221020059. The reversal of 20221020031 is 13002012202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20221020031 - 211 = 20221017983 is a prime.
It is a super-2 number, since 2×202210200312 (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 = 20221019993 and 20221020020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20221060031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186090 + ... + 273991.
It is an arithmetic number, because the mean of its divisors is an integer number (5055381016).
Almost surely, 220221020031 is an apocalyptic number.
20221020031 is a deficient number, since it is larger than the sum of its proper divisors (504033).
20221020031 is an equidigital number, since it uses as much as digits as its factorization.
20221020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504032.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20221020031 its reverse (13002012202), we get a palindrome (33223032233).
The spelling of 20221020031 in words is "twenty billion, two hundred twenty-one million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •