Base | Representation |
---|---|
bin | 10110011001011011111… |
… | …110011010010000110101 |
3 | 12110010210102001012210220 |
4 | 112121123332122100311 |
5 | 200204130143113000 |
6 | 3135023301204553 |
7 | 216125233601340 |
oct | 26313376322065 |
9 | 5403712035726 |
10 | 1539141379125 |
11 | 5438232018a9 |
12 | 20a367400759 |
13 | b21a962c97c |
14 | 546cdbad457 |
15 | 2a0837ca1a0 |
hex | 1665bf9a435 |
1539141379125 has 32 divisors (see below), whose sum is σ = 2927007153408. Its totient is φ = 703607486400.
The previous prime is 1539141379109. The next prime is 1539141379141. The reversal of 1539141379125 is 5219731419351.
It is an interprime number because it is at equal distance from previous prime (1539141379109) and next prime (1539141379141).
It is not a de Polignac number, because 1539141379125 - 24 = 1539141379109 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 293167162 + ... + 293172411.
It is an arithmetic number, because the mean of its divisors is an integer number (91468973544).
Almost surely, 21539141379125 is an apocalyptic number.
1539141379125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1539141379125 is a deficient number, since it is larger than the sum of its proper divisors (1387865774283).
1539141379125 is an equidigital number, since it uses as much as digits as its factorization.
1539141379125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586339598 (or 586339588 counting only the distinct ones).
The product of its digits is 1020600, while the sum is 51.
The spelling of 1539141379125 in words is "one trillion, five hundred thirty-nine billion, one hundred forty-one million, three hundred seventy-nine thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •