Base | Representation |
---|---|
bin | 10010111110101010110… |
… | …101000010110011001111 |
3 | 11121200110210202210120200 |
4 | 102332222311002303033 |
5 | 132332041211410021 |
6 | 2435054325344543 |
7 | 163141211424135 |
oct | 22765265026317 |
9 | 4550423683520 |
10 | 1304241122511 |
11 | 463142126318 |
12 | 19092b868153 |
13 | 95cb29708a2 |
14 | 471a8947755 |
15 | 23dd6429126 |
hex | 12faad42ccf |
1304241122511 has 12 divisors (see below), whose sum is σ = 1885844025000. Its totient is φ = 868598613360.
The previous prime is 1304241122501. The next prime is 1304241122539. The reversal of 1304241122511 is 1152211424031.
1304241122511 is a `hidden beast` number, since 1 + 3 + 0 + 4 + 24 + 1 + 122 + 511 = 666.
It is not a de Polignac number, because 1304241122511 - 218 = 1304240860367 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304241122501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 74613136 + ... + 74630613.
It is an arithmetic number, because the mean of its divisors is an integer number (157153668750).
Almost surely, 21304241122511 is an apocalyptic number.
1304241122511 is a deficient number, since it is larger than the sum of its proper divisors (581602902489).
1304241122511 is a wasteful number, since it uses less digits than its factorization.
1304241122511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149244726 (or 149244723 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 1304241122511 its reverse (1152211424031), we get a palindrome (2456452546542).
The spelling of 1304241122511 in words is "one trillion, three hundred four billion, two hundred forty-one million, one hundred twenty-two thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •