Base | Representation |
---|---|
bin | 100101101001111000101100… |
… | …1101001010100101001001011 |
3 | 1121102201120120211120102201102 |
4 | 1023103301121221110221023 |
5 | 321403040042203044034 |
6 | 3132232441323212015 |
7 | 126523202062165211 |
oct | 11323613151245113 |
9 | 1542646524512642 |
10 | 331212202003019 |
11 | 9659734038a087 |
12 | 3119318837700b |
13 | 112a723b09c49c |
14 | 5bb0a82aaccb1 |
15 | 28458c969697e |
hex | 12d3c59a54a4b |
331212202003019 has 2 divisors, whose sum is σ = 331212202003020. Its totient is φ = 331212202003018.
The previous prime is 331212202002973. The next prime is 331212202003141. The reversal of 331212202003019 is 910300202212133.
It is a weak prime.
It is an emirp because it is prime and its reverse (910300202212133) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331212202003019 is a prime.
It is a super-2 number, since 2×3312122020030192 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 331212202002982 and 331212202003000.
It is not a weakly prime, because it can be changed into another prime (331212202008019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165606101001509 + 165606101001510.
It is an arithmetic number, because the mean of its divisors is an integer number (165606101001510).
Almost surely, 2331212202003019 is an apocalyptic number.
331212202003019 is a deficient number, since it is larger than the sum of its proper divisors (1).
331212202003019 is an equidigital number, since it uses as much as digits as its factorization.
331212202003019 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 331212202003019 in words is "three hundred thirty-one trillion, two hundred twelve billion, two hundred two million, three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •