Base | Representation |
---|---|
bin | 10000100110010100011… |
… | …110110000111010001101 |
3 | 11001001020101012000020121 |
4 | 100212110132300322031 |
5 | 122142031300113221 |
6 | 2232002155144541 |
7 | 145260361101256 |
oct | 20462436607215 |
9 | 4031211160217 |
10 | 1140657426061 |
11 | 3aa82841aa5a |
12 | 165097a45151 |
13 | 8374311192a |
14 | 3d2cb0c9b2d |
15 | 1ea1004aa41 |
hex | 109947b0e8d |
1140657426061 has 8 divisors (see below), whose sum is σ = 1141152727680. Its totient is φ = 1140162208512.
The previous prime is 1140657426053. The next prime is 1140657426131. The reversal of 1140657426061 is 1606247560411.
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 1140657426061 - 23 = 1140657426053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140657425999 and 1140657426017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140657426001) 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, 53584126 + ... + 53605408.
It is an arithmetic number, because the mean of its divisors is an integer number (142644090960).
Almost surely, 21140657426061 is an apocalyptic number.
It is an amenable number.
1140657426061 is a deficient number, since it is larger than the sum of its proper divisors (495301619).
1140657426061 is a wasteful number, since it uses less digits than its factorization.
1140657426061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42035.
The product of its (nonzero) digits is 241920, while the sum is 43.
The spelling of 1140657426061 in words is "one trillion, one hundred forty billion, six hundred fifty-seven million, four hundred twenty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •