Base | Representation |
---|---|
bin | 100101100001110111111010… |
… | …1100100101001111100111001 |
3 | 1121021211022012222020022010010 |
4 | 1023003233311210221330321 |
5 | 321232014322411231301 |
6 | 3130030523255412133 |
7 | 126350506412564661 |
oct | 11303576544517471 |
9 | 1537738188208103 |
10 | 330111011430201 |
11 | 96202325a81111 |
12 | 31035885984049 |
13 | 11227447750971 |
14 | 5b7365b44b1a1 |
15 | 2826e2941d5d6 |
hex | 12c3bf5929f39 |
330111011430201 has 4 divisors (see below), whose sum is σ = 440148015240272. Its totient is φ = 220074007620132.
The previous prime is 330111011430197. The next prime is 330111011430209. The reversal of 330111011430201 is 102034110111033.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 330111011430201 - 22 = 330111011430197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330111011430209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55018501905031 + ... + 55018501905036.
It is an arithmetic number, because the mean of its divisors is an integer number (110037003810068).
Almost surely, 2330111011430201 is an apocalyptic number.
It is an amenable number.
330111011430201 is a deficient number, since it is larger than the sum of its proper divisors (110037003810071).
330111011430201 is a wasteful number, since it uses less digits than its factorization.
330111011430201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110037003810070.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 330111011430201 its reverse (102034110111033), we get a palindrome (432145121541234).
The spelling of 330111011430201 in words is "three hundred thirty trillion, one hundred eleven billion, eleven million, four hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •