Base | Representation |
---|---|
bin | 100101101010100010100001… |
… | …1010110101001100010001001 |
3 | 1121110001011102120100102020210 |
4 | 1023111011003112221202021 |
5 | 321411023020203303223 |
6 | 3132342014204311333 |
7 | 126532531650253260 |
oct | 11325050326514211 |
9 | 1543034376312223 |
10 | 331302022322313 |
11 | 96621442636419 |
12 | 311a8674b42549 |
13 | 112b2853900003 |
14 | 5bb5163b975d7 |
15 | 2847dd4d7e893 |
hex | 12d51435a9889 |
331302022322313 has 16 divisors (see below), whose sum is σ = 506663708205440. Its totient is φ = 188631992077056.
The previous prime is 331302022322291. The next prime is 331302022322329. The reversal of 331302022322313 is 313223220203133.
It is not a de Polignac number, because 331302022322313 - 28 = 331302022322057 is a prime.
It is a super-2 number, since 2×3313020223223132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (331302022323313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28477046128 + ... + 28477057761.
It is an arithmetic number, because the mean of its divisors is an integer number (31666481762840).
Almost surely, 2331302022322313 is an apocalyptic number.
It is an amenable number.
331302022322313 is a deficient number, since it is larger than the sum of its proper divisors (175361685883127).
331302022322313 is a wasteful number, since it uses less digits than its factorization.
331302022322313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56954104176.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 331302022322313 its reverse (313223220203133), we get a palindrome (644525242525446).
The spelling of 331302022322313 in words is "three hundred thirty-one trillion, three hundred two billion, twenty-two million, three hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.052 sec. • engine limits •