Base | Representation |
---|---|
bin | 100111111010… |
… | …0000101000010 |
3 | 1110100222112110 |
4 | 1033310011002 |
5 | 20324011230 |
6 | 2024240150 |
7 | 342561045 |
oct | 117640502 |
9 | 43328473 |
10 | 20922690 |
11 | 108a0588 |
12 | 7010056 |
13 | 44473b9 |
14 | 2ac8c5c |
15 | 1c844b0 |
hex | 13f4142 |
20922690 has 16 divisors (see below), whose sum is σ = 50214528. Its totient is φ = 5579376.
The previous prime is 20922679. The next prime is 20922691. The reversal of 20922690 is 9622902.
It is a super-2 number, since 2×209226902 = 875517913672200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 697423 = 20922690 / (2 + 0 + 9 + 2 + 2 + 6 + 9 + 0).
It is not an unprimeable number, because it can be changed into a prime (20922691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 348682 + ... + 348741.
It is an arithmetic number, because the mean of its divisors is an integer number (3138408).
Almost surely, 220922690 is an apocalyptic number.
20922690 is an abundant number, since it is smaller than the sum of its proper divisors (29291838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20922690 is a wasteful number, since it uses less digits than its factorization.
20922690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697433.
The product of its (nonzero) digits is 3888, while the sum is 30.
The square root of 20922690 is about 4574.1327046775. The cubic root of 20922690 is about 275.5534419159.
It can be divided in two parts, 20922 and 690, that added together give a palindrome (21612).
The spelling of 20922690 in words is "twenty million, nine hundred twenty-two thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •