Base | Representation |
---|---|
bin | 10100011000000111… |
… | …11011110110011001 |
3 | 1001020102010020000001 |
4 | 22030003323312121 |
5 | 134401040321114 |
6 | 5005313213001 |
7 | 535045364602 |
oct | 121403736631 |
9 | 31212106001 |
10 | 10939776409 |
11 | 4704244a31 |
12 | 2153861161 |
13 | 10545cc9a3 |
14 | 75acb4da9 |
15 | 440645374 |
hex | 28c0fbd99 |
10939776409 has 4 divisors (see below), whose sum is σ = 10940378404. Its totient is φ = 10939174416.
The previous prime is 10939776391. The next prime is 10939776413. The reversal of 10939776409 is 90467793901.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6342529600 + 4597246809 = 79640^2 + 67803^2 .
It is a cyclic number.
It is not a de Polignac number, because 10939776409 - 221 = 10937679257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10939776409.
It is not an unprimeable number, because it can be changed into a prime (10939776469) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272862 + ... + 310375.
It is an arithmetic number, because the mean of its divisors is an integer number (2735094601).
Almost surely, 210939776409 is an apocalyptic number.
It is an amenable number.
10939776409 is a deficient number, since it is larger than the sum of its proper divisors (601995).
10939776409 is an equidigital number, since it uses as much as digits as its factorization.
10939776409 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601994.
The product of its (nonzero) digits is 2571912, while the sum is 55.
It can be divided in two parts, 1093977 and 6409, that added together give a triangular number (1100386 = T1483).
The spelling of 10939776409 in words is "ten billion, nine hundred thirty-nine million, seven hundred seventy-six thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •