Base | Representation |
---|---|
bin | 11000000000011… |
… | …10100010100111 |
3 | 112000221110212100 |
4 | 30000032202213 |
5 | 403023324101 |
6 | 31552223143 |
7 | 4663516431 |
oct | 1400164247 |
9 | 460843770 |
10 | 201386151 |
11 | a374a43a |
12 | 5753aab3 |
13 | 32951205 |
14 | 1ca63651 |
15 | 12a2ee86 |
hex | c00e8a7 |
201386151 has 12 divisors (see below), whose sum is σ = 291079360. Its totient is φ = 134170560.
The previous prime is 201386113. The next prime is 201386161. The reversal of 201386151 is 151683102.
It is not a de Polignac number, because 201386151 - 210 = 201385127 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201386161) 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 11 ways as a sum of consecutive naturals, for example, 9471 + ... + 22191.
Almost surely, 2201386151 is an apocalyptic number.
201386151 is a deficient number, since it is larger than the sum of its proper divisors (89693209).
201386151 is a wasteful number, since it uses less digits than its factorization.
201386151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14486 (or 14483 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 201386151 is about 14191.0588399879. The cubic root of 201386151 is about 586.1514817259.
The spelling of 201386151 in words is "two hundred one million, three hundred eighty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •