Base | Representation |
---|---|
bin | 100010100100111… |
… | …1010010011010101 |
3 | 2222212011120212112 |
4 | 1011021322103111 |
5 | 4334004213010 |
6 | 311043400405 |
7 | 40515521051 |
oct | 10511722325 |
9 | 2885146775 |
10 | 1160226005 |
11 | 545a0aa74 |
12 | 284683105 |
13 | 1564a9783 |
14 | b0138c61 |
15 | 6bcd0a05 |
hex | 4527a4d5 |
1160226005 has 4 divisors (see below), whose sum is σ = 1392271212. Its totient is φ = 928180800.
The previous prime is 1160225953. The next prime is 1160226017. The reversal of 1160226005 is 5006220611.
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 652444849 + 507781156 = 25543^2 + 22534^2 .
It is not a de Polignac number, because 1160226005 - 220 = 1159177429 is a prime.
It is a super-2 number, since 2×11602260052 = 2692248765356520050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116022596 + ... + 116022605.
It is an arithmetic number, because the mean of its divisors is an integer number (348067803).
Almost surely, 21160226005 is an apocalyptic number.
It is an amenable number.
1160226005 is a deficient number, since it is larger than the sum of its proper divisors (232045207).
1160226005 is an equidigital number, since it uses as much as digits as its factorization.
1160226005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232045206.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1160226005 is about 34062.0904379047. The cubic root of 1160226005 is about 1050.7858078334.
Adding to 1160226005 its reverse (5006220611), we get a palindrome (6166446616).
The spelling of 1160226005 in words is "one billion, one hundred sixty million, two hundred twenty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •