Base | Representation |
---|---|
bin | 100110011100… |
… | …0001110101011 |
3 | 1101220220002000 |
4 | 1030320032223 |
5 | 20124401014 |
6 | 1555542043 |
7 | 333204600 |
oct | 114701653 |
9 | 41826060 |
10 | 20153259 |
11 | 10415495 |
12 | 68ba923 |
13 | 4238109 |
14 | 29686a7 |
15 | 1b81509 |
hex | 13383ab |
20153259 has 24 divisors (see below), whose sum is σ = 34733520. Its totient is φ = 11515392.
The previous prime is 20153251. The next prime is 20153291. The reversal of 20153259 is 95235102.
It is not a de Polignac number, because 20153259 - 23 = 20153251 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20153251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6294 + ... + 8939.
It is an arithmetic number, because the mean of its divisors is an integer number (1447230).
Almost surely, 220153259 is an apocalyptic number.
20153259 is a deficient number, since it is larger than the sum of its proper divisors (14580261).
20153259 is a wasteful number, since it uses less digits than its factorization.
20153259 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15256 (or 15243 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 20153259 is about 4489.2381313537. The cubic root of 20153259 is about 272.1333463457.
The spelling of 20153259 in words is "twenty million, one hundred fifty-three thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •