Base | Representation |
---|---|
bin | 1111001010000010000010… |
… | …11001000111101001010001 |
3 | 11101000022200000200220011201 |
4 | 13211001001121013221101 |
5 | 13332034412042232123 |
6 | 154515335512311201 |
7 | 10010005354523563 |
oct | 745010131075121 |
9 | 141008600626151 |
10 | 33330043320913 |
11 | a6902125a6769 |
12 | 38a37040a2501 |
13 | 157a018120101 |
14 | 83327b4a9333 |
15 | 3cbece5115ad |
hex | 1e5041647a51 |
33330043320913 has 2 divisors, whose sum is σ = 33330043320914. Its totient is φ = 33330043320912.
The previous prime is 33330043320907. The next prime is 33330043320949. The reversal of 33330043320913 is 31902334003333.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28515845640529 + 4814197680384 = 5340023^2 + 2194128^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33330043320913 is a prime.
It is a super-2 number, since 2×333300433209132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (33330043327913) 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 as a sum of consecutive naturals, namely, 16665021660456 + 16665021660457.
It is an arithmetic number, because the mean of its divisors is an integer number (16665021660457).
Almost surely, 233330043320913 is an apocalyptic number.
It is an amenable number.
33330043320913 is a deficient number, since it is larger than the sum of its proper divisors (1).
33330043320913 is an equidigital number, since it uses as much as digits as its factorization.
33330043320913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157464, while the sum is 37.
The spelling of 33330043320913 in words is "thirty-three trillion, three hundred thirty billion, forty-three million, three hundred twenty thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •