Base | Representation |
---|---|
bin | 1001100110111001011… |
… | …00001111110101011101 |
3 | 1011120002122012201000022 |
4 | 10303130230033311131 |
5 | 20402041221214323 |
6 | 411353255241525 |
7 | 32564453363450 |
oct | 4633454176535 |
9 | 1146078181008 |
10 | 330120101213 |
11 | 118004211131 |
12 | 53b906792a5 |
13 | 251900549c6 |
14 | 11d994d1497 |
15 | 88c1b0d4c8 |
hex | 4cdcb0fd5d |
330120101213 has 16 divisors (see below), whose sum is σ = 389624954880. Its totient is φ = 273709638000.
The previous prime is 330120101209. The next prime is 330120101221. The reversal of 330120101213 is 312101021033.
It is a cyclic number.
It is not a de Polignac number, because 330120101213 - 22 = 330120101209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 330120101191 and 330120101200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330120101203) 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 in 15 ways as a sum of consecutive naturals, for example, 146138 + ... + 825588.
It is an arithmetic number, because the mean of its divisors is an integer number (24351559680).
Almost surely, 2330120101213 is an apocalyptic number.
It is an amenable number.
330120101213 is a deficient number, since it is larger than the sum of its proper divisors (59504853667).
330120101213 is a wasteful number, since it uses less digits than its factorization.
330120101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681728.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 330120101213 its reverse (312101021033), we get a palindrome (642221122246).
The spelling of 330120101213 in words is "three hundred thirty billion, one hundred twenty million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •