Base | Representation |
---|---|
bin | 100001101111001… |
… | …1001000011011111 |
3 | 2220220010121111210 |
4 | 1003132121003133 |
5 | 4304300243130 |
6 | 304155315503 |
7 | 40024120242 |
oct | 10336310337 |
9 | 2826117453 |
10 | 1132040415 |
11 | 5310097a0 |
12 | 27714bb93 |
13 | 1506bb5cc |
14 | aa4bd259 |
15 | 695b45b0 |
hex | 437990df |
1132040415 has 16 divisors (see below), whose sum is σ = 1975925376. Its totient is φ = 548868000.
The previous prime is 1132040407. The next prime is 1132040417. The reversal of 1132040415 is 5140402311.
It is not a de Polignac number, because 1132040415 - 23 = 1132040407 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1132040391 and 1132040400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132040417) 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 15 ways as a sum of consecutive naturals, for example, 3430261 + ... + 3430590.
It is an arithmetic number, because the mean of its divisors is an integer number (123495336).
Almost surely, 21132040415 is an apocalyptic number.
1132040415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1132040415 is a deficient number, since it is larger than the sum of its proper divisors (843884961).
1132040415 is a wasteful number, since it uses less digits than its factorization.
1132040415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6860870.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1132040415 is about 33645.8082827564. The cubic root of 1132040415 is about 1042.2069796234.
Adding to 1132040415 its reverse (5140402311), we get a palindrome (6272442726).
The spelling of 1132040415 in words is "one billion, one hundred thirty-two million, forty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •