Base | Representation |
---|---|
bin | 100001010000101… |
… | …1011101110111001 |
3 | 2212210001202022211 |
4 | 1002201123232321 |
5 | 4241202414401 |
6 | 302425015121 |
7 | 36441233665 |
oct | 10241335671 |
9 | 2783052284 |
10 | 1116060601 |
11 | 522a94937 |
12 | 2719244a1 |
13 | 14a2b4cb6 |
14 | a831d8a5 |
15 | 67ea9951 |
hex | 4285bbb9 |
1116060601 has 4 divisors (see below), whose sum is σ = 1116220132. Its totient is φ = 1115901072.
The previous prime is 1116060599. The next prime is 1116060641. The reversal of 1116060601 is 1060606111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1060606111 = 479 ⋅2214209.
It can be written as a sum of positive squares in 2 ways, for example, as 293231376 + 822829225 = 17124^2 + 28685^2 .
It is a cyclic number.
It is not a de Polignac number, because 1116060601 - 21 = 1116060599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1116060641) 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, 68766 + ... + 83431.
It is an arithmetic number, because the mean of its divisors is an integer number (279055033).
Almost surely, 21116060601 is an apocalyptic number.
It is an amenable number.
1116060601 is a deficient number, since it is larger than the sum of its proper divisors (159531).
1116060601 is an equidigital number, since it uses as much as digits as its factorization.
1116060601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159530.
The product of its (nonzero) digits is 216, while the sum is 22.
The square root of 1116060601 is about 33407.4931864095. The cubic root of 1116060601 is about 1037.2798122947.
Adding to 1116060601 its reverse (1060606111), we get a palindrome (2176666712).
The spelling of 1116060601 in words is "one billion, one hundred sixteen million, sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •