Base | Representation |
---|---|
bin | 100010100101000… |
… | …0011000111110010 |
3 | 2222212020102102111 |
4 | 1011022003013302 |
5 | 4334011342010 |
6 | 311044235534 |
7 | 40516031266 |
oct | 10512030762 |
9 | 2885212374 |
10 | 1160262130 |
11 | 545a35125 |
12 | 28469bbaa |
13 | 1564c0051 |
14 | b01480a6 |
15 | 6bcdb58a |
hex | 452831f2 |
1160262130 has 8 divisors (see below), whose sum is σ = 2088471852. Its totient is φ = 464104848.
The previous prime is 1160262119. The next prime is 1160262133. The reversal of 1160262130 is 312620611.
It can be written as a sum of positive squares in 2 ways, for example, as 1093823329 + 66438801 = 33073^2 + 8151^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×11602621303 (a number of 28 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1160262133) by changing a digit.
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, 58013097 + ... + 58013116.
Almost surely, 21160262130 is an apocalyptic number.
1160262130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1160262130 is a deficient number, since it is larger than the sum of its proper divisors (928209722).
1160262130 is a wasteful number, since it uses less digits than its factorization.
1160262130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116026220.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1160262130 is about 34062.6207153824. The cubic root of 1160262130 is about 1050.7967135371.
Adding to 1160262130 its reverse (312620611), we get a palindrome (1472882741).
The spelling of 1160262130 in words is "one billion, one hundred sixty million, two hundred sixty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •