Base | Representation |
---|---|
bin | 100101100011010101101010… |
… | …0100011110101111101001101 |
3 | 1121022112112211120202122120100 |
4 | 1023012223110203311331031 |
5 | 321243314113141011023 |
6 | 3130303215131041313 |
7 | 126401164145143035 |
oct | 11306532443657515 |
9 | 1538475746678510 |
10 | 330312321032013 |
11 | 9627a739aa8561 |
12 | 310688a7ba0239 |
13 | 1124041a18a348 |
14 | 5b7d2b742c8c5 |
15 | 282c2ac82cc43 |
hex | 12c6ad48f5f4d |
330312321032013 has 24 divisors (see below), whose sum is σ = 492512661778176. Its totient is φ = 213103006300800.
The previous prime is 330312321032009. The next prime is 330312321032047. The reversal of 330312321032013 is 310230123213033.
330312321032013 is a `hidden beast` number, since 3 + 3 + 0 + 3 + 1 + 2 + 321 + 0 + 320 + 13 = 666.
It is not a de Polignac number, because 330312321032013 - 22 = 330312321032009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330312321032063) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30385378 + ... + 39798188.
It is an arithmetic number, because the mean of its divisors is an integer number (20521360907424).
Almost surely, 2330312321032013 is an apocalyptic number.
It is an amenable number.
330312321032013 is a deficient number, since it is larger than the sum of its proper divisors (162200340746163).
330312321032013 is a wasteful number, since it uses less digits than its factorization.
330312321032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9538625 (or 9538622 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 330312321032013 its reverse (310230123213033), we get a palindrome (640542444245046).
The spelling of 330312321032013 in words is "three hundred thirty trillion, three hundred twelve billion, three hundred twenty-one million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •