Base | Representation |
---|---|
bin | 100101110000100101001010… |
… | …1001001001001001111001101 |
3 | 1121112222112120122221022221112 |
4 | 1023201022111021021033031 |
5 | 322013123444214430442 |
6 | 3134215252145541405 |
7 | 126646524406266353 |
oct | 11341122511111715 |
9 | 1545875518838845 |
10 | 332132323201997 |
11 | 9691158885953a |
12 | 31301577044865 |
13 | 11342c36389a96 |
14 | 5c0340c4c97d3 |
15 | 285e7cd3d0082 |
hex | 12e12952493cd |
332132323201997 has 2 divisors, whose sum is σ = 332132323201998. Its totient is φ = 332132323201996.
The previous prime is 332132323201981. The next prime is 332132323202051. The reversal of 332132323201997 is 799102323231233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 326923790509156 + 5208532692841 = 18081034^2 + 2282221^2 .
It is a cyclic number.
It is not a de Polignac number, because 332132323201997 - 24 = 332132323201981 is a prime.
It is a super-2 number, since 2×3321323232019972 (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 (332132323201927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166066161600998 + 166066161600999.
It is an arithmetic number, because the mean of its divisors is an integer number (166066161600999).
Almost surely, 2332132323201997 is an apocalyptic number.
It is an amenable number.
332132323201997 is a deficient number, since it is larger than the sum of its proper divisors (1).
332132323201997 is an equidigital number, since it uses as much as digits as its factorization.
332132323201997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2204496, while the sum is 50.
The spelling of 332132323201997 in words is "three hundred thirty-two trillion, one hundred thirty-two billion, three hundred twenty-three million, two hundred one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •