Base | Representation |
---|---|
bin | 1100000000111100100… |
… | …1110101001110010111 |
3 | 201201210020211212011100 |
4 | 3000033021311032113 |
5 | 11340213120301001 |
6 | 234454043441143 |
7 | 20625045465345 |
oct | 3001711651627 |
9 | 651706755140 |
10 | 206412665751 |
11 | 7a5a2628966 |
12 | 340072261b3 |
13 | 16606a42556 |
14 | 9dc1a30995 |
15 | 5581423586 |
hex | 300f275397 |
206412665751 has 6 divisors (see below), whose sum is σ = 298151628320. Its totient is φ = 137608443828.
The previous prime is 206412665647. The next prime is 206412665777. The reversal of 206412665751 is 157566214602.
206412665751 is a `hidden beast` number, since 2 + 0 + 6 + 4 + 12 + 66 + 575 + 1 = 666.
206412665751 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 206412665751 - 211 = 206412663703 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 206412665697 and 206412665706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206412664751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11467370311 + ... + 11467370328.
Almost surely, 2206412665751 is an apocalyptic number.
206412665751 is a deficient number, since it is larger than the sum of its proper divisors (91738962569).
206412665751 is a wasteful number, since it uses less digits than its factorization.
206412665751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22934740645 (or 22934740642 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The spelling of 206412665751 in words is "two hundred six billion, four hundred twelve million, six hundred sixty-five thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •