Base | Representation |
---|---|
bin | 100001101111111… |
… | …1110110010010000 |
3 | 2220220220210002201 |
4 | 1003133332302100 |
5 | 4304402111404 |
6 | 304212252544 |
7 | 40030504132 |
oct | 10337766220 |
9 | 2826823081 |
10 | 1132457104 |
11 | 531273869 |
12 | 277311154 |
13 | 15080617c |
14 | aa58b052 |
15 | 69647ca4 |
hex | 437fec90 |
1132457104 has 45 divisors (see below), whose sum is σ = 2254406707. Its totient is φ = 551085152.
The previous prime is 1132457101. The next prime is 1132457107. The reversal of 1132457104 is 4017542311.
The square root of 1132457104 is 33652.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (1132457101) and next prime (1132457107).
It is a super-3 number, since 3×11324571043 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1132457101) 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 8 ways as a sum of consecutive naturals, for example, 6326487 + ... + 6326665.
Almost surely, 21132457104 is an apocalyptic number.
1132457104 is the 33652-nd square number.
It is an amenable number.
1132457104 is a deficient number, since it is larger than the sum of its proper divisors (1121949603).
1132457104 is an frugal number, since it uses more digits than its factorization.
1132457104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460 (or 228 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 28.
The cubic root of 1132457104 is about 1042.3348381067.
Adding to 1132457104 its reverse (4017542311), we get a palindrome (5149999415).
The spelling of 1132457104 in words is "one billion, one hundred thirty-two million, four hundred fifty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •