Base | Representation |
---|---|
bin | 111111011000000… |
… | …000010000110011 |
3 | 2202002201001121001 |
4 | 333120000100303 |
5 | 4134143212024 |
6 | 253301142431 |
7 | 35230352020 |
oct | 7730002063 |
9 | 2662631531 |
10 | 1063257139 |
11 | 4a61a990a |
12 | 2580baa17 |
13 | 13c387849 |
14 | a12d6547 |
15 | 63529244 |
hex | 3f600433 |
1063257139 has 8 divisors (see below), whose sum is σ = 1215393120. Its totient is φ = 911181696.
The previous prime is 1063257089. The next prime is 1063257161. The reversal of 1063257139 is 9317523601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1063257139 - 221 = 1061159987 is a prime.
It is a super-2 number, since 2×10632571392 = 2261031487268930642, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1063257098 and 1063257107.
It is not an unprimeable number, because it can be changed into a prime (1063254139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32517 + ... + 56425.
It is an arithmetic number, because the mean of its divisors is an integer number (151924140).
Almost surely, 21063257139 is an apocalyptic number.
1063257139 is a deficient number, since it is larger than the sum of its proper divisors (152135981).
1063257139 is an equidigital number, since it uses as much as digits as its factorization.
1063257139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30269.
The product of its (nonzero) digits is 34020, while the sum is 37.
The square root of 1063257139 is about 32607.6239398089. The cubic root of 1063257139 is about 1020.6561006937.
The spelling of 1063257139 in words is "one billion, sixty-three million, two hundred fifty-seven thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •