Base | Representation |
---|---|
bin | 10000010000100001100… |
… | …000011110100000101001 |
3 | 10221210211022212102220202 |
4 | 100100201200132200221 |
5 | 121301113414034130 |
6 | 2213131555201545 |
7 | 143501405256254 |
oct | 20204140364051 |
9 | 3853738772822 |
10 | 1117253658665 |
11 | 3a0908622131 |
12 | 160645ba62b5 |
13 | 814834c2461 |
14 | 3c10ab3609b |
15 | 1e0e0581145 |
hex | 1042181e829 |
1117253658665 has 8 divisors (see below), whose sum is σ = 1341052377288. Its totient is φ = 893570935680.
The previous prime is 1117253658659. The next prime is 1117253658709. The reversal of 1117253658665 is 5668563527111.
It can be written as a sum of positive squares in 4 ways, for example, as 365004472336 + 752249186329 = 604156^2 + 867323^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1117253658665 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 1117253658665.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28977716 + ... + 29016245.
It is an arithmetic number, because the mean of its divisors is an integer number (167631547161).
Almost surely, 21117253658665 is an apocalyptic number.
It is an amenable number.
1117253658665 is a deficient number, since it is larger than the sum of its proper divisors (223798718623).
1117253658665 is an equidigital number, since it uses as much as digits as its factorization.
1117253658665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57997819.
The product of its digits is 9072000, while the sum is 56.
The spelling of 1117253658665 in words is "one trillion, one hundred seventeen billion, two hundred fifty-three million, six hundred fifty-eight thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •