Base | Representation |
---|---|
bin | 10000100101111011001… |
… | …111111100100100001001 |
3 | 11001000010212122101110221 |
4 | 100211323033330210021 |
5 | 122140144413024431 |
6 | 2231452154110041 |
7 | 145244031013261 |
oct | 20457317744411 |
9 | 4030125571427 |
10 | 1140234111241 |
11 | 3aa6304802a5 |
12 | 164b9a11b321 |
13 | 836a64c91a4 |
14 | 3d28abb67a1 |
15 | 1e9d7cce111 |
hex | 1097b3fc909 |
1140234111241 has 8 divisors (see below), whose sum is σ = 1190576387520. Its totient is φ = 1090626758928.
The previous prime is 1140234111229. The next prime is 1140234111253. The reversal of 1140234111241 is 1421114320411.
It is an interprime number because it is at equal distance from previous prime (1140234111229) and next prime (1140234111253).
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 1140234111241 - 223 = 1140225722633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1140234111041) 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, 183727821 + ... + 183734026.
It is an arithmetic number, because the mean of its divisors is an integer number (148822048440).
Almost surely, 21140234111241 is an apocalyptic number.
It is an amenable number.
1140234111241 is a deficient number, since it is larger than the sum of its proper divisors (50342276279).
1140234111241 is a wasteful number, since it uses less digits than its factorization.
1140234111241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367461983.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 1140234111241 its reverse (1421114320411), we get a palindrome (2561348431652).
The spelling of 1140234111241 in words is "one trillion, one hundred forty billion, two hundred thirty-four million, one hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •