Base | Representation |
---|---|
bin | 10010111110100011001… |
… | …010100000111000010011 |
3 | 11121200010211210202221121 |
4 | 102332203022200320103 |
5 | 132331310302024021 |
6 | 2435033453303111 |
7 | 163135060426501 |
oct | 22764312407023 |
9 | 4550124722847 |
10 | 1304112533011 |
11 | 463086588102 |
12 | 1908b4794a97 |
13 | 95c9212a122 |
14 | 47195833671 |
15 | 23dc9ec8741 |
hex | 12fa32a0e13 |
1304112533011 has 4 divisors (see below), whose sum is σ = 1304115562800. Its totient is φ = 1304109503224.
The previous prime is 1304112532969. The next prime is 1304112533027. The reversal of 1304112533011 is 1103352114031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1304112533011 - 223 = 1304104144403 is a prime.
It is a super-2 number, since 2×13041125330112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1304115533011) 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 3 ways as a sum of consecutive naturals, for example, 735631 + ... + 1774648.
It is an arithmetic number, because the mean of its divisors is an integer number (326028890700).
Almost surely, 21304112533011 is an apocalyptic number.
1304112533011 is a deficient number, since it is larger than the sum of its proper divisors (3029789).
1304112533011 is an equidigital number, since it uses as much as digits as its factorization.
1304112533011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3029788.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 1304112533011 its reverse (1103352114031), we get a palindrome (2407464647042).
The spelling of 1304112533011 in words is "one trillion, three hundred four billion, one hundred twelve million, five hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •