Base | Representation |
---|---|
bin | 100110111001… |
… | …0100110000001 |
3 | 1102101001000011 |
4 | 1031302212001 |
5 | 20210023241 |
6 | 2005024521 |
7 | 335221555 |
oct | 115624601 |
9 | 42331004 |
10 | 20392321 |
11 | 10569064 |
12 | 69b5141 |
13 | 42bcb81 |
14 | 29cb865 |
15 | 1bcc281 |
hex | 1372981 |
20392321 has 4 divisors (see below), whose sum is σ = 20696752. Its totient is φ = 20087892.
The previous prime is 20392297. The next prime is 20392343. The reversal of 20392321 is 12329302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12329302 = 2 ⋅6164651.
It is a cyclic number.
It is not a de Polignac number, because 20392321 - 27 = 20392193 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20392292 and 20392301.
It is not an unprimeable number, because it can be changed into a prime (20398321) 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 3 ways as a sum of consecutive naturals, for example, 152115 + ... + 152248.
It is an arithmetic number, because the mean of its divisors is an integer number (5174188).
Almost surely, 220392321 is an apocalyptic number.
It is an amenable number.
20392321 is a deficient number, since it is larger than the sum of its proper divisors (304431).
20392321 is an equidigital number, since it uses as much as digits as its factorization.
20392321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304430.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 20392321 is about 4515.7857566541. The cubic root of 20392321 is about 273.2051529003.
The spelling of 20392321 in words is "twenty million, three hundred ninety-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •