Base | Representation |
---|---|
bin | 110000001101011111011… |
… | …000011000101000100011 |
3 | 102201201111001122111110022 |
4 | 300031133120120220203 |
5 | 413240031110404331 |
6 | 11013551432424055 |
7 | 461233503316325 |
oct | 60153730305043 |
9 | 12651431574408 |
10 | 3313020013091 |
11 | 1068053477578 |
12 | 45610384802b |
13 | 1b0554c19869 |
14 | b64cb2d3615 |
15 | 5b2a4ea967b |
hex | 3035f618a23 |
3313020013091 has 2 divisors, whose sum is σ = 3313020013092. Its totient is φ = 3313020013090.
The previous prime is 3313020013081. The next prime is 3313020013123. The reversal of 3313020013091 is 1903100203133.
It is a weak prime.
It is an emirp because it is prime and its reverse (1903100203133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3313020013091 - 218 = 3313019750947 is a prime.
It is a super-2 number, since 2×33130200130912 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3313020013091.
It is not a weakly prime, because it can be changed into another prime (3313020013031) 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, 1656510006545 + 1656510006546.
It is an arithmetic number, because the mean of its divisors is an integer number (1656510006546).
Almost surely, 23313020013091 is an apocalyptic number.
3313020013091 is a deficient number, since it is larger than the sum of its proper divisors (1).
3313020013091 is an equidigital number, since it uses as much as digits as its factorization.
3313020013091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
The spelling of 3313020013091 in words is "three trillion, three hundred thirteen billion, twenty million, thirteen thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •