Base | Representation |
---|---|
bin | 100101101001111100111001… |
… | …0110001001111101110000101 |
3 | 1121102202102211212012010011201 |
4 | 1023103321302301033232011 |
5 | 321403212021120214442 |
6 | 3132240531433502501 |
7 | 126523641304162621 |
oct | 11323716261175605 |
9 | 1542672755163151 |
10 | 331221213444997 |
11 | 965a0145085897 |
12 | 31194a82271a31 |
13 | 112a8046027785 |
14 | 5bb1299822181 |
15 | 2845c558837b7 |
hex | 12d3e72c4fb85 |
331221213444997 has 2 divisors, whose sum is σ = 331221213444998. Its totient is φ = 331221213444996.
The previous prime is 331221213444971. The next prime is 331221213445007. The reversal of 331221213444997 is 799444312122133.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 313316585964001 + 17904627480996 = 17700751^2 + 4231386^2 .
It is a cyclic number.
It is not a de Polignac number, because 331221213444997 - 219 = 331221212920709 is a prime.
It is a super-2 number, since 2×3312212134449972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331221213444697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165610606722498 + 165610606722499.
It is an arithmetic number, because the mean of its divisors is an integer number (165610606722499).
Almost surely, 2331221213444997 is an apocalyptic number.
It is an amenable number.
331221213444997 is a deficient number, since it is larger than the sum of its proper divisors (1).
331221213444997 is an equidigital number, since it uses as much as digits as its factorization.
331221213444997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7838208, while the sum is 55.
The spelling of 331221213444997 in words is "three hundred thirty-one trillion, two hundred twenty-one billion, two hundred thirteen million, four hundred forty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •