Base | Representation |
---|---|
bin | 110000011101110011011… |
… | …000000001010110001101 |
3 | 102210101200201210211221022 |
4 | 300131303120001112031 |
5 | 414031414021044323 |
6 | 11030005442443525 |
7 | 462423525133616 |
oct | 60356330012615 |
9 | 12711621724838 |
10 | 3330535331213 |
11 | 10745214052a2 |
12 | 4595916635a5 |
13 | 1b20b68c941c |
14 | b72ad5d4c0d |
15 | 5b97ca234c8 |
hex | 3077360158d |
3330535331213 has 2 divisors, whose sum is σ = 3330535331214. Its totient is φ = 3330535331212.
The previous prime is 3330535331147. The next prime is 3330535331219. The reversal of 3330535331213 is 3121335350333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2988465923524 + 342069407689 = 1728718^2 + 584867^2 .
It is a cyclic number.
It is not a de Polignac number, because 3330535331213 - 212 = 3330535327117 is a prime.
It is a super-2 number, since 2×33305353312132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3330535331219) 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, 1665267665606 + 1665267665607.
It is an arithmetic number, because the mean of its divisors is an integer number (1665267665607).
Almost surely, 23330535331213 is an apocalyptic number.
It is an amenable number.
3330535331213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3330535331213 is an equidigital number, since it uses as much as digits as its factorization.
3330535331213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 109350, while the sum is 35.
The spelling of 3330535331213 in words is "three trillion, three hundred thirty billion, five hundred thirty-five million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •