Base | Representation |
---|---|
bin | 10000100110000000111… |
… | …110111001001101010101 |
3 | 11001000101120122111121100 |
4 | 100212000332321031111 |
5 | 122140344024214331 |
6 | 2231505511540313 |
7 | 145246306441524 |
oct | 20460076711525 |
9 | 4030346574540 |
10 | 1140330304341 |
11 | 3aa67a801628 |
12 | 16500638a699 |
13 | 836c0408c97 |
14 | 3d2998964bb |
15 | 1e9e1480ae6 |
hex | 10980fb9355 |
1140330304341 has 48 divisors (see below), whose sum is σ = 1740682944000. Its totient is φ = 717369760800.
The previous prime is 1140330304339. The next prime is 1140330304369. The reversal of 1140330304341 is 1434030330411.
1140330304341 is a `hidden beast` number, since 1 + 14 + 0 + 3 + 3 + 0 + 304 + 341 = 666.
It is not a de Polignac number, because 1140330304341 - 21 = 1140330304339 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140330304381) 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 47 ways as a sum of consecutive naturals, for example, 47204616 + ... + 47228766.
It is an arithmetic number, because the mean of its divisors is an integer number (36264228000).
Almost surely, 21140330304341 is an apocalyptic number.
It is an amenable number.
1140330304341 is a deficient number, since it is larger than the sum of its proper divisors (600352639659).
1140330304341 is a wasteful number, since it uses less digits than its factorization.
1140330304341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25254 (or 25251 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1140330304341 its reverse (1434030330411), we get a palindrome (2574360634752).
The spelling of 1140330304341 in words is "one trillion, one hundred forty billion, three hundred thirty million, three hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •