Base | Representation |
---|---|
bin | 100101100011010110000101… |
… | …0101111010010010010110101 |
3 | 1121022112122011221011002001201 |
4 | 1023012230022233102102311 |
5 | 321243322443340020313 |
6 | 3130303445241252501 |
7 | 126401225523226255 |
oct | 11306541257222265 |
9 | 1538478157132051 |
10 | 330313230001333 |
11 | 962800660a6677 |
12 | 31068b00494131 |
13 | 112405335a4407 |
14 | 5b7d362041965 |
15 | 282c31252c0dd |
hex | 12c6b0abd24b5 |
330313230001333 has 8 divisors (see below), whose sum is σ = 331050423140352. Its totient is φ = 329576772220176.
The previous prime is 330313230001301. The next prime is 330313230001357. The reversal of 330313230001333 is 333100032313033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 330313230001333 - 25 = 330313230001301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330313230007333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182940085 + ... + 184736842.
It is an arithmetic number, because the mean of its divisors is an integer number (41381302892544).
Almost surely, 2330313230001333 is an apocalyptic number.
It is an amenable number.
330313230001333 is a deficient number, since it is larger than the sum of its proper divisors (737193139019).
330313230001333 is a wasteful number, since it uses less digits than its factorization.
330313230001333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367678931.
The product of its (nonzero) digits is 13122, while the sum is 28.
Adding to 330313230001333 its reverse (333100032313033), we get a palindrome (663413262314366).
The spelling of 330313230001333 in words is "three hundred thirty trillion, three hundred thirteen billion, two hundred thirty million, one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •