Base | Representation |
---|---|
bin | 100110010110… |
… | …0111110001111 |
3 | 1101211112211022 |
4 | 1030230332033 |
5 | 20121412101 |
6 | 1554544355 |
7 | 332623301 |
oct | 114547617 |
9 | 41745738 |
10 | 20107151 |
11 | 10393889 |
12 | 68980bb |
13 | 422012c |
14 | 2955971 |
15 | 1b72a1b |
hex | 132cf8f |
20107151 has 2 divisors, whose sum is σ = 20107152. Its totient is φ = 20107150.
The previous prime is 20107133. The next prime is 20107163. The reversal of 20107151 is 15170102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20107151 - 210 = 20106127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20107051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10053575 + 10053576.
It is an arithmetic number, because the mean of its divisors is an integer number (10053576).
Almost surely, 220107151 is an apocalyptic number.
20107151 is a deficient number, since it is larger than the sum of its proper divisors (1).
20107151 is an equidigital number, since it uses as much as digits as its factorization.
20107151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 17.
The square root of 20107151 is about 4484.0997981758. The cubic root of 20107151 is about 271.9256527986.
Adding to 20107151 its reverse (15170102), we get a palindrome (35277253).
The spelling of 20107151 in words is "twenty million, one hundred seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •