Base | Representation |
---|---|
bin | 10000100101011100011… |
… | …000111101011111010001 |
3 | 11000221210210102221120221 |
4 | 100211130120331133101 |
5 | 122133114343140000 |
6 | 2231324541233041 |
7 | 145225143251464 |
oct | 20453430753721 |
9 | 4027723387527 |
10 | 1139716380625 |
11 | 3aa395203659 |
12 | 164a74862781 |
13 | 83623176904 |
14 | 3d23c1272db |
15 | 1e9a761261a |
hex | 1095c63d7d1 |
1139716380625 has 15 divisors (see below), whose sum is σ = 1424222941053. Its totient is φ = 911751753000.
The previous prime is 1139716380611. The next prime is 1139716380631. The reversal of 1139716380625 is 5260836179311.
The square root of 1139716380625 is 1067575.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 89353764241 + 1050362616384 = 298921^2 + 1024872^2 .
It is not a de Polignac number, because 1139716380625 - 215 = 1139716347857 is a prime.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 26668024 + ... + 26710726.
Almost surely, 21139716380625 is an apocalyptic number.
1139716380625 is the 1067575-th square number.
1139716380625 is the 533788-th centered octagonal number.
It is an amenable number.
1139716380625 is a deficient number, since it is larger than the sum of its proper divisors (284506560428).
1139716380625 is an frugal number, since it uses more digits than its factorization.
1139716380625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85426 (or 42708 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 52.
The spelling of 1139716380625 in words is "one trillion, one hundred thirty-nine billion, seven hundred sixteen million, three hundred eighty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •