Base | Representation |
---|---|
bin | 1001100111011010111… |
… | …01110101010010000101 |
3 | 1011120211020210000201221 |
4 | 10303231131311102011 |
5 | 20403130243110414 |
6 | 411441231320341 |
7 | 32604441465442 |
oct | 4635535652205 |
9 | 1146736700657 |
10 | 330401535109 |
11 | 118139064628 |
12 | 5404a9800b1 |
13 | 25206451c39 |
14 | 11dc4a309c9 |
15 | 88db6a1224 |
hex | 4ced775485 |
330401535109 has 2 divisors, whose sum is σ = 330401535110. Its totient is φ = 330401535108.
The previous prime is 330401535091. The next prime is 330401535143. The reversal of 330401535109 is 901535104033.
It is a happy number.
Together with previous prime (330401535091) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (330401535143) can be obtained adding 330401535109 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 218860230625 + 111541304484 = 467825^2 + 333978^2 .
It is a cyclic number.
It is not a de Polignac number, because 330401535109 - 215 = 330401502341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330401535809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165200767554 + 165200767555.
It is an arithmetic number, because the mean of its divisors is an integer number (165200767555).
Almost surely, 2330401535109 is an apocalyptic number.
It is an amenable number.
330401535109 is a deficient number, since it is larger than the sum of its proper divisors (1).
330401535109 is an equidigital number, since it uses as much as digits as its factorization.
330401535109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24300, while the sum is 34.
The spelling of 330401535109 in words is "three hundred thirty billion, four hundred one million, five hundred thirty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.294 sec. • engine limits •