Base | Representation |
---|---|
bin | 100101110001111101000100… |
… | …1001111100111000011000101 |
3 | 1121120122120211222210120100112 |
4 | 1023203322021033213003011 |
5 | 322024222104121201042 |
6 | 3134442112353322405 |
7 | 126666256464565001 |
oct | 11343721117470305 |
9 | 1546576758716315 |
10 | 332321102131397 |
11 | 96984651618275 |
12 | 31332080866405 |
13 | 1135798ca2a7c2 |
14 | 5c0c5da1d1701 |
15 | 286467b697982 |
hex | 12e3e893e70c5 |
332321102131397 has 2 divisors, whose sum is σ = 332321102131398. Its totient is φ = 332321102131396.
The previous prime is 332321102131327. The next prime is 332321102131427. The reversal of 332321102131397 is 793131201123233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 250398944352001 + 81922157779396 = 15823999^2 + 9051086^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-332321102131397 is a prime.
It is a super-2 number, since 2×3323211021313972 (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 (332321102131327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166160551065698 + 166160551065699.
It is an arithmetic number, because the mean of its divisors is an integer number (166160551065699).
Almost surely, 2332321102131397 is an apocalyptic number.
It is an amenable number.
332321102131397 is a deficient number, since it is larger than the sum of its proper divisors (1).
332321102131397 is an equidigital number, since it uses as much as digits as its factorization.
332321102131397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 41.
The spelling of 332321102131397 in words is "three hundred thirty-two trillion, three hundred twenty-one billion, one hundred two million, one hundred thirty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •