Base | Representation |
---|---|
bin | 111110001111111… |
… | …010111110101010 |
3 | 2200210011001010212 |
4 | 332033322332222 |
5 | 4114324024010 |
6 | 251344141122 |
7 | 34610631431 |
oct | 7617727652 |
9 | 2623131125 |
10 | 1044361130 |
11 | 496572a7a |
12 | 2519077a2 |
13 | 13849ca87 |
14 | 9c9b8118 |
15 | 61a45505 |
hex | 3e3fafaa |
1044361130 has 8 divisors (see below), whose sum is σ = 1879850052. Its totient is φ = 417744448.
The previous prime is 1044361127. The next prime is 1044361133. The reversal of 1044361130 is 311634401.
It is an interprime number because it is at equal distance from previous prime (1044361127) and next prime (1044361133).
It can be written as a sum of positive squares in 2 ways, for example, as 1037290849 + 7070281 = 32207^2 + 2659^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1044361096 and 1044361105.
It is not an unprimeable number, because it can be changed into a prime (1044361133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52218047 + ... + 52218066.
Almost surely, 21044361130 is an apocalyptic number.
1044361130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1044361130 is a deficient number, since it is larger than the sum of its proper divisors (835488922).
1044361130 is a wasteful number, since it uses less digits than its factorization.
1044361130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104436120.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 1044361130 is about 32316.5767060807. The cubic root of 1044361130 is about 1014.5736211345.
Adding to 1044361130 its reverse (311634401), we get a palindrome (1355995531).
The spelling of 1044361130 in words is "one billion, forty-four million, three hundred sixty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •