Base | Representation |
---|---|
bin | 100101100001110111111011… |
… | …0110111110010101111000011 |
3 | 1121021211022021111020112202201 |
4 | 1023003233312313302233003 |
5 | 321232014344001133011 |
6 | 3130030525354454031 |
7 | 126350510066045065 |
oct | 11303576667625703 |
9 | 1537738244215681 |
10 | 330111033224131 |
11 | 96202337307225 |
12 | 31035891134317 |
13 | 1122744c111793 |
14 | 5b736602c1735 |
15 | 2826e2b2c5cc1 |
hex | 12c3bf6df2bc3 |
330111033224131 has 2 divisors, whose sum is σ = 330111033224132. Its totient is φ = 330111033224130.
The previous prime is 330111033224123. The next prime is 330111033224171. The reversal of 330111033224131 is 131422330111033.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 330111033224131 - 23 = 330111033224123 is a prime.
It is a super-2 number, since 2×3301110332241312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 330111033224131.
It is not a weakly prime, because it can be changed into another prime (330111033224101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165055516612065 + 165055516612066.
It is an arithmetic number, because the mean of its divisors is an integer number (165055516612066).
Almost surely, 2330111033224131 is an apocalyptic number.
330111033224131 is a deficient number, since it is larger than the sum of its proper divisors (1).
330111033224131 is an equidigital number, since it uses as much as digits as its factorization.
330111033224131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 330111033224131 its reverse (131422330111033), we get a palindrome (461533363335164).
The spelling of 330111033224131 in words is "three hundred thirty trillion, one hundred eleven billion, thirty-three million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •