Base | Representation |
---|---|
bin | 10011110100100000… |
… | …00000101010110101 |
3 | 1000110120211100221221 |
4 | 21322100000222311 |
5 | 133243040430424 |
6 | 4515520310341 |
7 | 524456412433 |
oct | 117220005265 |
9 | 30416740857 |
10 | 10640951989 |
11 | 45705a37a8 |
12 | 208b7723b1 |
13 | 1007723cc5 |
14 | 72d329d53 |
15 | 4242b99e4 |
hex | 27a400ab5 |
10640951989 has 8 divisors (see below), whose sum is σ = 10991722680. Its totient is φ = 10293506496.
The previous prime is 10640951977. The next prime is 10640951999. The reversal of 10640951989 is 98915904601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5303480625 + 5337471364 = 72825^2 + 73058^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10640951989 - 27 = 10640951861 is a prime.
It is a super-3 number, since 3×106409519893 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10640951999) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 824794 + ... + 837595.
It is an arithmetic number, because the mean of its divisors is an integer number (1373965335).
Almost surely, 210640951989 is an apocalyptic number.
It is an amenable number.
10640951989 is a deficient number, since it is larger than the sum of its proper divisors (350770691).
10640951989 is a wasteful number, since it uses less digits than its factorization.
10640951989 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1662599.
The product of its (nonzero) digits is 699840, while the sum is 52.
The spelling of 10640951989 in words is "ten billion, six hundred forty million, nine hundred fifty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •