Base | Representation |
---|---|
bin | 10010111110101010110… |
… | …101000000111110100001 |
3 | 11121200110210202102100000 |
4 | 102332222311000332201 |
5 | 132332041211140131 |
6 | 2435054325250213 |
7 | 163141211363304 |
oct | 22765265007641 |
9 | 4550423672300 |
10 | 1304241115041 |
11 | 463142120747 |
12 | 19092b863969 |
13 | 95cb296a377 |
14 | 471a8944b3b |
15 | 23dd6426ce6 |
hex | 12faad40fa1 |
1304241115041 has 12 divisors (see below), whose sum is σ = 1953678049232. Its totient is φ = 869494076532.
The previous prime is 1304241115007. The next prime is 1304241115057. The reversal of 1304241115041 is 1405111424031.
It is a happy number.
1304241115041 is a `hidden beast` number, since 1 + 3 + 0 + 42 + 4 + 111 + 504 + 1 = 666.
It is not a de Polignac number, because 1304241115041 - 26 = 1304241114977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1304241114996 and 1304241115014.
It is not an unprimeable number, because it can be changed into a prime (1304241165041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2683623451 + ... + 2683623936.
Almost surely, 21304241115041 is an apocalyptic number.
It is an amenable number.
1304241115041 is a deficient number, since it is larger than the sum of its proper divisors (649436934191).
1304241115041 is an frugal number, since it uses more digits than its factorization.
1304241115041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5367247402 (or 5367247390 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 1304241115041 its reverse (1405111424031), we get a palindrome (2709352539072).
The spelling of 1304241115041 in words is "one trillion, three hundred four billion, two hundred forty-one million, one hundred fifteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •