Base | Representation |
---|---|
bin | 10011010110111100001… |
… | …111101000100110001111 |
3 | 11201011202002222220200202 |
4 | 103112330033220212033 |
5 | 133243430044001034 |
6 | 2455044404244115 |
7 | 165053102600426 |
oct | 23267417504617 |
9 | 4634662886622 |
10 | 1330303109519 |
11 | 4731a647395a |
12 | 1959a39a063b |
13 | 985a7208787 |
14 | 4855bd762bd |
15 | 2490e47447e |
hex | 135bc3e898f |
1330303109519 has 2 divisors, whose sum is σ = 1330303109520. Its totient is φ = 1330303109518.
The previous prime is 1330303109507. The next prime is 1330303109521. The reversal of 1330303109519 is 9159013030331.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (9159013030331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1330303109519 - 24 = 1330303109503 is a prime.
It is a super-2 number, since 2×13303031095192 (a number of 25 digits) contains 22 as substring.
Together with 1330303109521, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330303139519) 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 as a sum of consecutive naturals, namely, 665151554759 + 665151554760.
It is an arithmetic number, because the mean of its divisors is an integer number (665151554760).
Almost surely, 21330303109519 is an apocalyptic number.
1330303109519 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330303109519 is an equidigital number, since it uses as much as digits as its factorization.
1330303109519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32805, while the sum is 38.
The spelling of 1330303109519 in words is "one trillion, three hundred thirty billion, three hundred three million, one hundred nine thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •