Base | Representation |
---|---|
bin | 100101100011010000110111… |
… | …0110100100101011011010011 |
3 | 1121022111120020222110220100221 |
4 | 1023012201232310211123103 |
5 | 321243132021144211011 |
6 | 3130254353302253511 |
7 | 126400351034456131 |
oct | 11306415664453323 |
9 | 1538446228426327 |
10 | 330302024210131 |
11 | 9627633578a906 |
12 | 310668b3727297 |
13 | 1123c468b4582c |
14 | 5b7c9bbac2751 |
15 | 282bda888c971 |
hex | 12c686ed256d3 |
330302024210131 has 2 divisors, whose sum is σ = 330302024210132. Its totient is φ = 330302024210130.
The previous prime is 330302024210117. The next prime is 330302024210141. The reversal of 330302024210131 is 131012420203033.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-330302024210131 is a prime.
It is a super-2 number, since 2×3303020242101312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330302024210096 and 330302024210105.
It is not a weakly prime, because it can be changed into another prime (330302024210101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165151012105065 + 165151012105066.
It is an arithmetic number, because the mean of its divisors is an integer number (165151012105066).
Almost surely, 2330302024210131 is an apocalyptic number.
330302024210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
330302024210131 is an equidigital number, since it uses as much as digits as its factorization.
330302024210131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 330302024210131 its reverse (131012420203033), we get a palindrome (461314444413164).
The spelling of 330302024210131 in words is "three hundred thirty trillion, three hundred two billion, twenty-four million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •