Base | Representation |
---|---|
bin | 10000010000100001101… |
… | …110011000110011000111 |
3 | 10221210211120201201010211 |
4 | 100100201232120303013 |
5 | 121301120332232122 |
6 | 2213132205300251 |
7 | 143501451254644 |
oct | 20204156306307 |
9 | 3853746651124 |
10 | 1117257305287 |
11 | 3a090a692972 |
12 | 160647264687 |
13 | 8148419b216 |
14 | 3c10b404dcb |
15 | 1e0e0a51877 |
hex | 10421b98cc7 |
1117257305287 has 4 divisors (see below), whose sum is σ = 1130718236760. Its totient is φ = 1103796373816.
The previous prime is 1117257305267. The next prime is 1117257305293. The reversal of 1117257305287 is 7825037527111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1117257305287 - 227 = 1117123087559 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 1117257305287.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1117257305267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6730465612 + ... + 6730465777.
It is an arithmetic number, because the mean of its divisors is an integer number (282679559190).
Almost surely, 21117257305287 is an apocalyptic number.
1117257305287 is a deficient number, since it is larger than the sum of its proper divisors (13460931473).
1117257305287 is an equidigital number, since it uses as much as digits as its factorization.
1117257305287 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13460931472.
The product of its (nonzero) digits is 823200, while the sum is 49.
The spelling of 1117257305287 in words is "one trillion, one hundred seventeen billion, two hundred fifty-seven million, three hundred five thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •