Base | Representation |
---|---|
bin | 100110001100… |
… | …1001100101001 |
3 | 1101200102201101 |
4 | 1030121030221 |
5 | 20111314103 |
6 | 1553121401 |
7 | 332135200 |
oct | 114311451 |
9 | 41612641 |
10 | 20026153 |
11 | 10338a44 |
12 | 6859261 |
13 | 41c22c4 |
14 | 2934237 |
15 | 1b58a1d |
hex | 1319329 |
20026153 has 24 divisors (see below), whose sum is σ = 25547400. Its totient is φ = 15579648.
The previous prime is 20026151. The next prime is 20026177. The reversal of 20026153 is 35162002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6210064 + 13816089 = 2492^2 + 3717^2 .
It is not a de Polignac number, because 20026153 - 21 = 20026151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20026153.
It is not an unprimeable number, because it can be changed into a prime (20026151) 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 23 ways as a sum of consecutive naturals, for example, 23743 + ... + 24571.
It is an arithmetic number, because the mean of its divisors is an integer number (1064475).
Almost surely, 220026153 is an apocalyptic number.
It is an amenable number.
20026153 is a deficient number, since it is larger than the sum of its proper divisors (5521247).
20026153 is a wasteful number, since it uses less digits than its factorization.
20026153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889 (or 882 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 20026153 is about 4475.0589940245. The cubic root of 20026153 is about 271.5600270644.
Adding to 20026153 its reverse (35162002), we get a palindrome (55188155).
The spelling of 20026153 in words is "twenty million, twenty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •