Base | Representation |
---|---|
bin | 1010011100010010… |
… | …01100100111010111 |
3 | 112110200200100210210 |
4 | 11032021030213113 |
5 | 42440114013421 |
6 | 2324140020503 |
7 | 255631136364 |
oct | 51611144727 |
9 | 15420610723 |
10 | 5606001111 |
11 | 2417494677 |
12 | 1105531733 |
13 | 6b4578b29 |
14 | 3b276b46b |
15 | 22c25c576 |
hex | 14e24c9d7 |
5606001111 has 8 divisors (see below), whose sum is σ = 7475788144. Its totient is φ = 3736774080.
The previous prime is 5606001109. The next prime is 5606001113. The reversal of 5606001111 is 1111006065.
It is an interprime number because it is at equal distance from previous prime (5606001109) and next prime (5606001113).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5606001111 - 21 = 5606001109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5606001113) 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 7 ways as a sum of consecutive naturals, for example, 116056 + ... + 157101.
It is an arithmetic number, because the mean of its divisors is an integer number (934473518).
Almost surely, 25606001111 is an apocalyptic number.
5606001111 is a deficient number, since it is larger than the sum of its proper divisors (1869787033).
5606001111 is a wasteful number, since it uses less digits than its factorization.
5606001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280001.
The product of its (nonzero) digits is 180, while the sum is 21.
The square root of 5606001111 is about 74873.2336085467. The cubic root of 5606001111 is about 1776.4421116100.
Adding to 5606001111 its reverse (1111006065), we get a palindrome (6717007176).
The spelling of 5606001111 in words is "five billion, six hundred six million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •