Base | Representation |
---|---|
bin | 1100000001000001000… |
… | …1101100111011100111 |
3 | 201201211120022001022221 |
4 | 3000100101230323213 |
5 | 11340232431144101 |
6 | 234455555333211 |
7 | 20625364564543 |
oct | 3002021547347 |
9 | 651746261287 |
10 | 206431506151 |
11 | 7a602226a42 |
12 | 340115b1207 |
13 | 1660a90ac10 |
14 | 9dc4336a23 |
15 | 5582de5aa1 |
hex | 301046cee7 |
206431506151 has 4 divisors (see below), whose sum is σ = 222310852792. Its totient is φ = 190552159512.
The previous prime is 206431506121. The next prime is 206431506167. The reversal of 206431506151 is 151605134602.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151605134602 = 2 ⋅75802567301.
It is not a de Polignac number, because 206431506151 - 235 = 172071767783 is a prime.
It is a super-2 number, since 2×2064315061512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206431506121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7939673301 + ... + 7939673326.
It is an arithmetic number, because the mean of its divisors is an integer number (55577713198).
Almost surely, 2206431506151 is an apocalyptic number.
206431506151 is a deficient number, since it is larger than the sum of its proper divisors (15879346641).
206431506151 is a wasteful number, since it uses less digits than its factorization.
206431506151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15879346640.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 206431506151 in words is "two hundred six billion, four hundred thirty-one million, five hundred six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •