Base | Representation |
---|---|
bin | 101000100010001… |
… | …1011100100100101 |
3 | 10111210022001101212 |
4 | 1101010123210211 |
5 | 10241142203010 |
6 | 342544001205 |
7 | 45463536533 |
oct | 12104334445 |
9 | 3453261355 |
10 | 1360116005 |
11 | 638828316 |
12 | 31b600205 |
13 | 188a25991 |
14 | cc8cd153 |
15 | 7e617505 |
hex | 5111b925 |
1360116005 has 4 divisors (see below), whose sum is σ = 1632139212. Its totient is φ = 1088092800.
The previous prime is 1360115983. The next prime is 1360116019. The reversal of 1360116005 is 5006110631.
It is a happy number.
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 454286596 + 905829409 = 21314^2 + 30097^2 .
It is not a de Polignac number, because 1360116005 - 28 = 1360115749 is a prime.
It is a Duffinian number.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 136011596 + ... + 136011605.
It is an arithmetic number, because the mean of its divisors is an integer number (408034803).
Almost surely, 21360116005 is an apocalyptic number.
It is an amenable number.
1360116005 is a deficient number, since it is larger than the sum of its proper divisors (272023207).
1360116005 is an equidigital number, since it uses as much as digits as its factorization.
1360116005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272023206.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 1360116005 is about 36879.7506092436. The cubic root of 1360116005 is about 1107.9631518306.
Adding to 1360116005 its reverse (5006110631), we get a palindrome (6366226636).
The spelling of 1360116005 in words is "one billion, three hundred sixty million, one hundred sixteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •