Base | Representation |
---|---|
bin | 1001100111000100011… |
… | …11100001001010101011 |
3 | 1011120100010110022020201 |
4 | 10303202033201022223 |
5 | 20402234041431243 |
6 | 411410423333031 |
7 | 32566664112601 |
oct | 4634217411253 |
9 | 1146303408221 |
10 | 330213233323 |
11 | 118051841716 |
12 | 53bb78b1177 |
13 | 251a643246c |
14 | 11da7a15871 |
15 | 88c9da804d |
hex | 4ce23e12ab |
330213233323 has 4 divisors (see below), whose sum is σ = 344570330448. Its totient is φ = 315856136200.
The previous prime is 330213233159. The next prime is 330213233347. The reversal of 330213233323 is 323332312033.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-330213233323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 330213233291 and 330213233300.
It is not an unprimeable number, because it can be changed into a prime (330213233923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7178548528 + ... + 7178548573.
It is an arithmetic number, because the mean of its divisors is an integer number (86142582612).
Almost surely, 2330213233323 is an apocalyptic number.
330213233323 is a deficient number, since it is larger than the sum of its proper divisors (14357097125).
330213233323 is a wasteful number, since it uses less digits than its factorization.
330213233323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14357097124.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 330213233323 its reverse (323332312033), we get a palindrome (653545545356).
The spelling of 330213233323 in words is "three hundred thirty billion, two hundred thirteen million, two hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •