Base | Representation |
---|---|
bin | 100101100011011010101100… |
… | …0010111100010010110100101 |
3 | 1121022120120201100022121010111 |
4 | 1023012311120113202112211 |
5 | 321244003223304124333 |
6 | 3130312203020253021 |
7 | 126402025622530531 |
oct | 11306653027422645 |
9 | 1538516640277114 |
10 | 330323122333093 |
11 | 9628428206196a |
12 | 3106aa013a1171 |
13 | 1124144bb94966 |
14 | 5b7da1db78bc1 |
15 | 282c6e0c1d4cd |
hex | 12c6d585e25a5 |
330323122333093 has 2 divisors, whose sum is σ = 330323122333094. Its totient is φ = 330323122333092.
The previous prime is 330323122333069. The next prime is 330323122333097. The reversal of 330323122333093 is 390333221323033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 318007079559009 + 12316042774084 = 17832753^2 + 3509422^2 .
It is a cyclic number.
It is not a de Polignac number, because 330323122333093 - 237 = 330185683379621 is a prime.
It is a super-2 number, since 2×3303231223330932 (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 (330323122333097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165161561166546 + 165161561166547.
It is an arithmetic number, because the mean of its divisors is an integer number (165161561166547).
Almost surely, 2330323122333093 is an apocalyptic number.
It is an amenable number.
330323122333093 is a deficient number, since it is larger than the sum of its proper divisors (1).
330323122333093 is an equidigital number, since it uses as much as digits as its factorization.
330323122333093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 472392, while the sum is 40.
The spelling of 330323122333093 in words is "three hundred thirty trillion, three hundred twenty-three billion, one hundred twenty-two million, three hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •