Base | Representation |
---|---|
bin | 111101111101111… |
… | …010100001110101 |
3 | 2200110021012220212 |
4 | 331331322201311 |
5 | 4112122000233 |
6 | 251055035205 |
7 | 34522541300 |
oct | 7575724165 |
9 | 2613235825 |
10 | 1039640693 |
11 | 493939493 |
12 | 25020bb05 |
13 | 137509310 |
14 | 9c109b37 |
15 | 61411a48 |
hex | 3df7a875 |
1039640693 has 24 divisors (see below), whose sum is σ = 1304509752. Its totient is φ = 821245824.
The previous prime is 1039640663. The next prime is 1039640699. The reversal of 1039640693 is 3960469301.
It can be written as a sum of positive squares in 4 ways, for example, as 9102289 + 1030538404 = 3017^2 + 32102^2 .
It is not a de Polignac number, because 1039640693 - 210 = 1039639669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1039640693.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1039640699) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 634271 + ... + 635907.
It is an arithmetic number, because the mean of its divisors is an integer number (54354573).
Almost surely, 21039640693 is an apocalyptic number.
1039640693 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1039640693 is a deficient number, since it is larger than the sum of its proper divisors (264869059).
1039640693 is a wasteful number, since it uses less digits than its factorization.
1039640693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2661 (or 2654 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 41.
The square root of 1039640693 is about 32243.4596934014. The cubic root of 1039640693 is about 1013.0427124108.
The spelling of 1039640693 in words is "one billion, thirty-nine million, six hundred forty thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •