Base | Representation |
---|---|
bin | 100101100001111100001001… |
… | …1011110010111100010101001 |
3 | 1121021212011200120200120112202 |
4 | 1023003320103132113202221 |
5 | 321232141432334024001 |
6 | 3130035025352145545 |
7 | 126351250620125411 |
oct | 11303702336274251 |
9 | 1537764616616482 |
10 | 330120103033001 |
11 | 96206170a48936 |
12 | 310375a26982b5 |
13 | 112282661945a8 |
14 | 5b73c80aa9641 |
15 | 28272ac69196b |
hex | 12c3e137978a9 |
330120103033001 has 4 divisors (see below), whose sum is σ = 330120571885392. Its totient is φ = 330119634180612.
The previous prime is 330120103032989. The next prime is 330120103033031. The reversal of 330120103033001 is 100330301021033.
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 a cyclic number.
It is not a de Polignac number, because 330120103033001 - 246 = 259751358855337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330120103033031) 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, 233368451 + ... + 234778776.
It is an arithmetic number, because the mean of its divisors is an integer number (82530142971348).
Almost surely, 2330120103033001 is an apocalyptic number.
It is an amenable number.
330120103033001 is a deficient number, since it is larger than the sum of its proper divisors (468852391).
330120103033001 is an equidigital number, since it uses as much as digits as its factorization.
330120103033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468852390.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 330120103033001 its reverse (100330301021033), we get a palindrome (430450404054034).
The spelling of 330120103033001 in words is "three hundred thirty trillion, one hundred twenty billion, one hundred three million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •