Base | Representation |
---|---|
bin | 100101100001110111111010… |
… | …0111101010010111001001111 |
3 | 1121021211022012020211002101211 |
4 | 1023003233310331102321033 |
5 | 321232014312241042033 |
6 | 3130030522250315251 |
7 | 126350506226102116 |
oct | 11303576475227117 |
9 | 1537738166732354 |
10 | 330111001112143 |
11 | 96202320173a99 |
12 | 31035882428b27 |
13 | 1122744557a3c4 |
14 | 5b73659d22c7d |
15 | 2826e285812cd |
hex | 12c3bf4f52e4f |
330111001112143 has 2 divisors, whose sum is σ = 330111001112144. Its totient is φ = 330111001112142.
The previous prime is 330111001112099. The next prime is 330111001112159. The reversal of 330111001112143 is 341211100111033.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 330111001112143 - 217 = 330111000981071 is a prime.
It is a super-2 number, since 2×3301110011121432 (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 (330111001112443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165055500556071 + 165055500556072.
It is an arithmetic number, because the mean of its divisors is an integer number (165055500556072).
Almost surely, 2330111001112143 is an apocalyptic number.
330111001112143 is a deficient number, since it is larger than the sum of its proper divisors (1).
330111001112143 is an equidigital number, since it uses as much as digits as its factorization.
330111001112143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 330111001112143 its reverse (341211100111033), we get a palindrome (671322101223176).
The spelling of 330111001112143 in words is "three hundred thirty trillion, one hundred eleven billion, one million, one hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •