Base | Representation |
---|---|
bin | 100110011100… |
… | …0010011100001 |
3 | 1101220220111111 |
4 | 1030320103201 |
5 | 20124403234 |
6 | 1555543321 |
7 | 333205522 |
oct | 114702341 |
9 | 41826444 |
10 | 20153569 |
11 | 10415747 |
12 | 68bab41 |
13 | 42382b7 |
14 | 2968849 |
15 | 1b81664 |
hex | 13384e1 |
20153569 has 2 divisors, whose sum is σ = 20153570. Its totient is φ = 20153568.
The previous prime is 20153561. The next prime is 20153587. The reversal of 20153569 is 96535102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13838400 + 6315169 = 3720^2 + 2513^2 .
It is a cyclic number.
It is not a de Polignac number, because 20153569 - 23 = 20153561 is a prime.
It is a super-2 number, since 2×201535692 = 812332686875522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20153569.
It is not a weakly prime, because it can be changed into another prime (20153561) 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, 10076784 + 10076785.
It is an arithmetic number, because the mean of its divisors is an integer number (10076785).
Almost surely, 220153569 is an apocalyptic number.
It is an amenable number.
20153569 is a deficient number, since it is larger than the sum of its proper divisors (1).
20153569 is an equidigital number, since it uses as much as digits as its factorization.
20153569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
The square root of 20153569 is about 4489.2726582376. The cubic root of 20153569 is about 272.1347416685.
The spelling of 20153569 in words is "twenty million, one hundred fifty-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •