Base | Representation |
---|---|
bin | 100110110101… |
… | …1000100111101 |
3 | 1102022110202212 |
4 | 1031223010331 |
5 | 20203032113 |
6 | 2004230205 |
7 | 335033033 |
oct | 115530475 |
9 | 42273685 |
10 | 20361533 |
11 | 10547a15 |
12 | 699b365 |
13 | 42abb5a |
14 | 29c0553 |
15 | 1bc30a8 |
hex | 136b13d |
20361533 has 2 divisors, whose sum is σ = 20361534. Its totient is φ = 20361532.
The previous prime is 20361511. The next prime is 20361547. The reversal of 20361533 is 33516302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19166884 + 1194649 = 4378^2 + 1093^2 .
It is a cyclic number.
It is not a de Polignac number, because 20361533 - 26 = 20361469 is a prime.
It is a super-2 number, since 2×203615332 = 829184052220178, which contains 22 as substring.
It is equal to p1292063 and since 20361533 and 1292063 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 20361499 and 20361508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20361503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10180766 + 10180767.
It is an arithmetic number, because the mean of its divisors is an integer number (10180767).
Almost surely, 220361533 is an apocalyptic number.
It is an amenable number.
20361533 is a deficient number, since it is larger than the sum of its proper divisors (1).
20361533 is an equidigital number, since it uses as much as digits as its factorization.
20361533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 23.
The square root of 20361533 is about 4512.3755384498. The cubic root of 20361533 is about 273.0675900574.
Adding to 20361533 its reverse (33516302), we get a palindrome (53877835).
The spelling of 20361533 in words is "twenty million, three hundred sixty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •