Base | Representation |
---|---|
bin | 10011110011010111… |
… | …00111000000000001 |
3 | 1000102220212120100112 |
4 | 21321223213000001 |
5 | 133233120102130 |
6 | 4514540001105 |
7 | 524312330312 |
oct | 117153470001 |
9 | 30386776315 |
10 | 10631409665 |
11 | 4566176488 |
12 | 2088530195 |
13 | 1005762866 |
14 | 72bd64609 |
15 | 423532495 |
hex | 279ae7001 |
10631409665 has 8 divisors (see below), whose sum is σ = 12759026280. Its totient is φ = 8504237952.
The previous prime is 10631409619. The next prime is 10631409671. The reversal of 10631409665 is 56690413601.
It can be written as a sum of positive squares in 4 ways, for example, as 5281364929 + 5350044736 = 72673^2 + 73144^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 10631409665 - 220 = 10630361089 is a prime.
It is a super-2 number, since 2×106314096652 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56174 + ... + 156263.
It is an arithmetic number, because the mean of its divisors is an integer number (1594878285).
Almost surely, 210631409665 is an apocalyptic number.
It is an amenable number.
10631409665 is a deficient number, since it is larger than the sum of its proper divisors (2127616615).
10631409665 is a wasteful number, since it uses less digits than its factorization.
10631409665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222451.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 10631409665 in words is "ten billion, six hundred thirty-one million, four hundred nine thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •