Base | Representation |
---|---|
bin | 100101100011011010101100… |
… | …0010111100010010110111101 |
3 | 1121022120120201100022121011101 |
4 | 1023012311120113202112331 |
5 | 321244003223304124432 |
6 | 3130312203020253101 |
7 | 126402025622530564 |
oct | 11306653027422675 |
9 | 1538516640277141 |
10 | 330323122333117 |
11 | 96284282061991 |
12 | 3106aa013a1191 |
13 | 1124144bb94984 |
14 | 5b7da1db78bdb |
15 | 282c6e0c1d4e7 |
hex | 12c6d585e25bd |
330323122333117 has 2 divisors, whose sum is σ = 330323122333118. Its totient is φ = 330323122333116.
The previous prime is 330323122333097. The next prime is 330323122333151. The reversal of 330323122333117 is 711333221323033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278210590685316 + 52112531647801 = 16679646^2 + 7218901^2 .
It is a cyclic number.
It is not a de Polignac number, because 330323122333117 - 231 = 330320974849469 is a prime.
It is a super-2 number, since 2×3303231223331172 (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 (330323122333157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165161561166558 + 165161561166559.
It is an arithmetic number, because the mean of its divisors is an integer number (165161561166559).
Almost surely, 2330323122333117 is an apocalyptic number.
It is an amenable number.
330323122333117 is a deficient number, since it is larger than the sum of its proper divisors (1).
330323122333117 is an equidigital number, since it uses as much as digits as its factorization.
330323122333117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 122472, while the sum is 37.
The spelling of 330323122333117 in words is "three hundred thirty trillion, three hundred twenty-three billion, one hundred twenty-two million, three hundred thirty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •