Base | Representation |
---|---|
bin | 1001100111010000011… |
… | …00111001100100010101 |
3 | 1011120121002120122122112 |
4 | 10303220030321210111 |
5 | 20402440140211013 |
6 | 411424354240405 |
7 | 32602316650304 |
oct | 4635014714425 |
9 | 1146532518575 |
10 | 330313210133 |
11 | 1180a3217785 |
12 | 54025286105 |
13 | 251c106853a |
14 | 11db6ddc43b |
15 | 88d3a55ba8 |
hex | 4ce8339915 |
330313210133 has 4 divisors (see below), whose sum is σ = 340968475008. Its totient is φ = 319657945260.
The previous prime is 330313210121. The next prime is 330313210141. The reversal of 330313210133 is 331012313033.
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 330313210133 - 26 = 330313210069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 330313210099 and 330313210108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330313210163) 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, 5327632391 + ... + 5327632452.
It is an arithmetic number, because the mean of its divisors is an integer number (85242118752).
Almost surely, 2330313210133 is an apocalyptic number.
It is an amenable number.
330313210133 is a deficient number, since it is larger than the sum of its proper divisors (10655264875).
330313210133 is a wasteful number, since it uses less digits than its factorization.
330313210133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10655264874.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 330313210133 its reverse (331012313033), we get a palindrome (661325523166).
The spelling of 330313210133 in words is "three hundred thirty billion, three hundred thirteen million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •