Base | Representation |
---|---|
bin | 100110110000… |
… | …0111100100001 |
3 | 1102020100211211 |
4 | 1031200330201 |
5 | 20200220113 |
6 | 2003310121 |
7 | 334501036 |
oct | 115407441 |
9 | 42210754 |
10 | 20320033 |
11 | 10519818 |
12 | 697b341 |
13 | 4295cb6 |
14 | 29ad38d |
15 | 1bb5b3d |
hex | 1360f21 |
20320033 has 2 divisors, whose sum is σ = 20320034. Its totient is φ = 20320032.
The previous prime is 20320031. The next prime is 20320043. The reversal of 20320033 is 33002302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16064064 + 4255969 = 4008^2 + 2063^2 .
It is a cyclic number.
It is not a de Polignac number, because 20320033 - 21 = 20320031 is a prime.
It is a super-2 number, since 2×203200332 = 825807482242178, which contains 22 as substring.
Together with 20320031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20319995 and 20320022.
It is not a weakly prime, because it can be changed into another prime (20320031) 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 as a sum of consecutive naturals, namely, 10160016 + 10160017.
It is an arithmetic number, because the mean of its divisors is an integer number (10160017).
Almost surely, 220320033 is an apocalyptic number.
It is an amenable number.
20320033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20320033 is an equidigital number, since it uses as much as digits as its factorization.
20320033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 13.
The square root of 20320033 is about 4507.7747281780. The cubic root of 20320033 is about 272.8819456739.
Adding to 20320033 its reverse (33002302), we get a palindrome (53322335).
The spelling of 20320033 in words is "twenty million, three hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •