Base | Representation |
---|---|
bin | 100110011010… |
… | …0001111110111 |
3 | 1101220001201000 |
4 | 1030310033313 |
5 | 20123340301 |
6 | 1555334343 |
7 | 333106212 |
oct | 114641767 |
9 | 41801630 |
10 | 20136951 |
11 | 1040420a |
12 | 68b13b3 |
13 | 4230873 |
14 | 2962779 |
15 | 1b7b786 |
hex | 13343f7 |
20136951 has 16 divisors (see below), whose sum is σ = 29932000. Its totient is φ = 13379904.
The previous prime is 20136913. The next prime is 20136953. The reversal of 20136951 is 15963102.
It is not a de Polignac number, because 20136951 - 29 = 20136439 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20136953) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8355 + ... + 10491.
It is an arithmetic number, because the mean of its divisors is an integer number (1870750).
Almost surely, 220136951 is an apocalyptic number.
20136951 is a deficient number, since it is larger than the sum of its proper divisors (9795049).
20136951 is a wasteful number, since it uses less digits than its factorization.
20136951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2495 (or 2489 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 20136951 is about 4487.4214199248. The cubic root of 20136951 is about 272.0599231802.
Subtracting from 20136951 its reverse (15963102), we obtain a square (4173849 = 20432).
The spelling of 20136951 in words is "twenty million, one hundred thirty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •