Base | Representation |
---|---|
bin | 1010010010001011100100… |
… | …1010000000111000001101 |
3 | 1111000222112100111220002201 |
4 | 2210202321022000320031 |
5 | 2440230134321124234 |
6 | 40014324153321501 |
7 | 2244636256662115 |
oct | 244427112007015 |
9 | 44028470456081 |
10 | 11307460333069 |
11 | 366a51563392a |
12 | 1327565706291 |
13 | 64039aa32914 |
14 | 2b13d9422045 |
15 | 1491edcb2314 |
hex | a48b9280e0d |
11307460333069 has 2 divisors, whose sum is σ = 11307460333070. Its totient is φ = 11307460333068.
The previous prime is 11307460333003. The next prime is 11307460333087. The reversal of 11307460333069 is 96033306470311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10920632311044 + 386828022025 = 3304638^2 + 621955^2 .
It is a cyclic number.
It is not a de Polignac number, because 11307460333069 - 29 = 11307460332557 is a prime.
It is a super-2 number, since 2×113074603330692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11307460333469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5653730166534 + 5653730166535.
It is an arithmetic number, because the mean of its divisors is an integer number (5653730166535).
Almost surely, 211307460333069 is an apocalyptic number.
It is an amenable number.
11307460333069 is a deficient number, since it is larger than the sum of its proper divisors (1).
11307460333069 is an equidigital number, since it uses as much as digits as its factorization.
11307460333069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 734832, while the sum is 46.
The spelling of 11307460333069 in words is "eleven trillion, three hundred seven billion, four hundred sixty million, three hundred thirty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •