Base | Representation |
---|---|
bin | 100101100010000000110011… |
… | …1011010011011001100011011 |
3 | 1121021220010111101001002212111 |
4 | 1023010001213122123030123 |
5 | 321232322421403020443 |
6 | 3130043401432053151 |
7 | 126352053443250121 |
oct | 11304014732331433 |
9 | 1537803441032774 |
10 | 330130101220123 |
11 | 9620a4317348a6 |
12 | 31039512b341b7 |
13 | 1122919a698849 |
14 | 5b7454c8b9911 |
15 | 28276952e269d |
hex | 12c406769b31b |
330130101220123 has 2 divisors, whose sum is σ = 330130101220124. Its totient is φ = 330130101220122.
The previous prime is 330130101220109. The next prime is 330130101220133. The reversal of 330130101220123 is 321022101031033.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 330130101220123 - 237 = 329992662266651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 330130101220094 and 330130101220103.
It is not a weakly prime, because it can be changed into another prime (330130101220133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165065050610061 + 165065050610062.
It is an arithmetic number, because the mean of its divisors is an integer number (165065050610062).
Almost surely, 2330130101220123 is an apocalyptic number.
330130101220123 is a deficient number, since it is larger than the sum of its proper divisors (1).
330130101220123 is an equidigital number, since it uses as much as digits as its factorization.
330130101220123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 330130101220123 its reverse (321022101031033), we get a palindrome (651152202251156).
The spelling of 330130101220123 in words is "three hundred thirty trillion, one hundred thirty billion, one hundred one million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •