Base | Representation |
---|---|
bin | 1010010111111010111000… |
… | …1111111010011111111111 |
3 | 1111101102001001011010102222 |
4 | 2211332232033322133333 |
5 | 2443334103231000424 |
6 | 40131512232235555 |
7 | 2255026560512156 |
oct | 245765617723777 |
9 | 44342031133388 |
10 | 11406061578239 |
11 | 36a83134507a9 |
12 | 13426a2b3bbbb |
13 | 64978280b583 |
14 | 2b60b07b659d |
15 | 14ba70300e5e |
hex | a5fae3fa7ff |
11406061578239 has 8 divisors (see below), whose sum is σ = 12223652362080. Its totient is φ = 10615277049696.
The previous prime is 11406061578211. The next prime is 11406061578287. The reversal of 11406061578239 is 93287516060411.
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 11406061578239 - 28 = 11406061577983 is a prime.
It is a super-2 number, since 2×114060615782392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11406061578739) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6701562944 + ... + 6701564645.
It is an arithmetic number, because the mean of its divisors is an integer number (1527956545260).
It is a 1-persistent number, because it is pandigital, but 2⋅11406061578239 = 22812123156478 is not.
Almost surely, 211406061578239 is an apocalyptic number.
11406061578239 is a deficient number, since it is larger than the sum of its proper divisors (817590783841).
11406061578239 is a wasteful number, since it uses less digits than its factorization.
11406061578239 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13403127649.
The product of its (nonzero) digits is 2177280, while the sum is 53.
The spelling of 11406061578239 in words is "eleven trillion, four hundred six billion, sixty-one million, five hundred seventy-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •