Base | Representation |
---|---|
bin | 1100000010111110100… |
… | …0111000001000111000 |
3 | 201210012020101012101110 |
4 | 3000233220320020320 |
5 | 11342322131100224 |
6 | 235024113120320 |
7 | 20644414132650 |
oct | 3005750701070 |
9 | 653166335343 |
10 | 206957675064 |
11 | 7a852237488 |
12 | 341398590a0 |
13 | 1669292627a |
14 | a034181360 |
15 | 55b41cc929 |
hex | 302fa38238 |
206957675064 has 64 divisors (see below), whose sum is σ = 595074009600. Its totient is φ = 58754127744.
The previous prime is 206957675059. The next prime is 206957675069. The reversal of 206957675064 is 460576759602.
It is an interprime number because it is at equal distance from previous prime (206957675059) and next prime (206957675069).
It is a junction number, because it is equal to n+sod(n) for n = 206957674995 and 206957675013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206957675069) 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, 3896844 + ... + 3949595.
It is an arithmetic number, because the mean of its divisors is an integer number (9298031400).
Almost surely, 2206957675064 is an apocalyptic number.
206957675064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
206957675064 is an abundant number, since it is smaller than the sum of its proper divisors (388116334536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206957675064 is a wasteful number, since it uses less digits than its factorization.
206957675064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7846612 (or 7846608 counting only the distinct ones).
The product of its (nonzero) digits is 19051200, while the sum is 57.
The spelling of 206957675064 in words is "two hundred six billion, nine hundred fifty-seven million, six hundred seventy-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •