Base | Representation |
---|---|
bin | 100001101111111… |
… | …1101010011101010 |
3 | 2220220220110210111 |
4 | 1003133331103222 |
5 | 4304401413200 |
6 | 304212204534 |
7 | 40030450363 |
oct | 10337752352 |
9 | 2826813714 |
10 | 1132451050 |
11 | 53126a265 |
12 | 27730974a |
13 | 1508034a3 |
14 | aa588b6a |
15 | 696460ba |
hex | 437fd4ea |
1132451050 has 12 divisors (see below), whose sum is σ = 2106359046. Its totient is φ = 452980400.
The previous prime is 1132451011. The next prime is 1132451051. The reversal of 1132451050 is 501542311.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 856791441 + 275659609 = 29271^2 + 16603^2 .
It is a super-2 number, since 2×11324510502 = 2564890761292205000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1132451051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11324461 + ... + 11324560.
Almost surely, 21132451050 is an apocalyptic number.
1132451050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1132451050 is a deficient number, since it is larger than the sum of its proper divisors (973907996).
1132451050 is a wasteful number, since it uses less digits than its factorization.
1132451050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22649033 (or 22649028 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1132451050 is about 33651.9100498025. The cubic root of 1132451050 is about 1042.3329806982.
Adding to 1132451050 its reverse (501542311), we get a palindrome (1633993361).
The spelling of 1132451050 in words is "one billion, one hundred thirty-two million, four hundred fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •