Base | Representation |
---|---|
bin | 1010010010000000100001… |
… | …0000011100110010000001 |
3 | 1111000200212111220222000102 |
4 | 2210200020100130302001 |
5 | 2440203100031443433 |
6 | 40013113453332145 |
7 | 2244502601264405 |
oct | 244401020346201 |
9 | 44020774828012 |
10 | 11304492452993 |
11 | 3669232311683 |
12 | 1326a77797055 |
13 | 640016bb626c |
14 | 2b11d71bb105 |
15 | 1490c84654e8 |
hex | a480841cc81 |
11304492452993 has 2 divisors, whose sum is σ = 11304492452994. Its totient is φ = 11304492452992.
The previous prime is 11304492452969. The next prime is 11304492453011. The reversal of 11304492452993 is 39925429440311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6629759828224 + 4674732624769 = 2574832^2 + 2162113^2 .
It is a cyclic number.
It is not a de Polignac number, because 11304492452993 - 210 = 11304492451969 is a prime.
It is a super-3 number, since 3×113044924529933 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11304492452933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5652246226496 + 5652246226497.
It is an arithmetic number, because the mean of its divisors is an integer number (5652246226497).
Almost surely, 211304492452993 is an apocalyptic number.
It is an amenable number.
11304492452993 is a deficient number, since it is larger than the sum of its proper divisors (1).
11304492452993 is an equidigital number, since it uses as much as digits as its factorization.
11304492452993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8398080, while the sum is 56.
The spelling of 11304492452993 in words is "eleven trillion, three hundred four billion, four hundred ninety-two million, four hundred fifty-two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •