Base | Representation |
---|---|
bin | 100101100001111000100100… |
… | …1110001100110100000101011 |
3 | 1121021211102212102102212122201 |
4 | 1023003301021301212200223 |
5 | 321232030221033010443 |
6 | 3130031315402201031 |
7 | 126350556415301224 |
oct | 11303611161464053 |
9 | 1537742772385581 |
10 | 330112424110123 |
11 | 96202990440486 |
12 | 31035bbaab3177 |
13 | 1122761131ba45 |
14 | 5b73752d0024b |
15 | 2826ead46a34d |
hex | 12c3c49c6682b |
330112424110123 has 2 divisors, whose sum is σ = 330112424110124. Its totient is φ = 330112424110122.
The previous prime is 330112424110099. The next prime is 330112424110141. The reversal of 330112424110123 is 321011424211033.
It is a strong prime.
It is an emirp because it is prime and its reverse (321011424211033) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-330112424110123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 330112424110091 and 330112424110100.
It is not a weakly prime, because it can be changed into another prime (330112424110723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165056212055061 + 165056212055062.
It is an arithmetic number, because the mean of its divisors is an integer number (165056212055062).
Almost surely, 2330112424110123 is an apocalyptic number.
330112424110123 is a deficient number, since it is larger than the sum of its proper divisors (1).
330112424110123 is an equidigital number, since it uses as much as digits as its factorization.
330112424110123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 330112424110123 its reverse (321011424211033), we get a palindrome (651123848321156).
The spelling of 330112424110123 in words is "three hundred thirty trillion, one hundred twelve billion, four hundred twenty-four million, one hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •