Base | Representation |
---|---|
bin | 111110001010000… |
… | …001000011010000 |
3 | 2200200020101200202 |
4 | 332022001003100 |
5 | 4113430010021 |
6 | 251251034332 |
7 | 34561523351 |
oct | 7612010320 |
9 | 2620211622 |
10 | 1042813136 |
11 | 495705a42 |
12 | 25129b9a8 |
13 | 13807a2c1 |
14 | 9c6d3d28 |
15 | 6183ba0b |
hex | 3e2810d0 |
1042813136 has 10 divisors (see below), whose sum is σ = 2020450482. Its totient is φ = 521406560.
The previous prime is 1042813127. The next prime is 1042813151. The reversal of 1042813136 is 6313182401.
It can be written as a sum of positive squares in only one way, i.e., 1036840000 + 5973136 = 32200^2 + 2444^2 .
It is a super-2 number, since 2×10428131362 = 2174918473228308992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042813099 and 1042813108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32587895 + ... + 32587926.
Almost surely, 21042813136 is an apocalyptic number.
1042813136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1042813136 is a deficient number, since it is larger than the sum of its proper divisors (977637346).
1042813136 is an equidigital number, since it uses as much as digits as its factorization.
1042813136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65175829 (or 65175823 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 1042813136 is about 32292.6173606290. The cubic root of 1042813136 is about 1014.0720926715.
Adding to 1042813136 its reverse (6313182401), we get a palindrome (7355995537).
The spelling of 1042813136 in words is "one billion, forty-two million, eight hundred thirteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •