Base | Representation |
---|---|
bin | 10000100101001100111… |
… | …100011100101110001001 |
3 | 11000221010201211122122101 |
4 | 100211030330130232021 |
5 | 122132102023420022 |
6 | 2231243123153401 |
7 | 145215545542255 |
oct | 20451474345611 |
9 | 4027121748571 |
10 | 1139457248137 |
11 | 3aa271a0257a |
12 | 164a01b15861 |
13 | 835b1587490 |
14 | 3d215951265 |
15 | 1e98e9c7627 |
hex | 1094cf1cb89 |
1139457248137 has 8 divisors (see below), whose sum is σ = 1227297586760. Its totient is φ = 1051644021120.
The previous prime is 1139457248131. The next prime is 1139457248161. The reversal of 1139457248137 is 7318427549311.
It can be written as a sum of positive squares in 4 ways, for example, as 1247784976 + 1138209463161 = 35324^2 + 1066869^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1139457248137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1139457248131) 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 7 ways as a sum of consecutive naturals, for example, 6690564 + ... + 6858757.
It is an arithmetic number, because the mean of its divisors is an integer number (153412198345).
Almost surely, 21139457248137 is an apocalyptic number.
It is an amenable number.
1139457248137 is a deficient number, since it is larger than the sum of its proper divisors (87840338623).
1139457248137 is a wasteful number, since it uses less digits than its factorization.
1139457248137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13555803.
The product of its digits is 5080320, while the sum is 55.
The spelling of 1139457248137 in words is "one trillion, one hundred thirty-nine billion, four hundred fifty-seven million, two hundred forty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •