Base | Representation |
---|---|
bin | 100101101010101011001101… |
… | …1000111100100100110001101 |
3 | 1121110002221120110222000212012 |
4 | 1023111112123013210212031 |
5 | 321411324220201243000 |
6 | 3132354341112151005 |
7 | 126534062116301141 |
oct | 11325263307444615 |
9 | 1543087513860765 |
10 | 331320674634125 |
11 | 96629344356350 |
12 | 311b01bb698465 |
13 | 112b45370138c7 |
14 | 5bb60130a7221 |
15 | 284862763a735 |
hex | 12d559b1e498d |
331320674634125 has 32 divisors (see below), whose sum is σ = 465628943010816. Its totient is φ = 233187571560000.
The previous prime is 331320674634121. The next prime is 331320674634217. The reversal of 331320674634125 is 521436476023133.
It is not a de Polignac number, because 331320674634125 - 22 = 331320674634121 is a prime.
It is a super-2 number, since 2×3313206746341252 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331320674634121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3886416902 + ... + 3886502151.
It is an arithmetic number, because the mean of its divisors is an integer number (14550904469088).
Almost surely, 2331320674634125 is an apocalyptic number.
It is an amenable number.
331320674634125 is a deficient number, since it is larger than the sum of its proper divisors (134308268376691).
331320674634125 is a wasteful number, since it uses less digits than its factorization.
331320674634125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7772919110 (or 7772919100 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 50.
The spelling of 331320674634125 in words is "three hundred thirty-one trillion, three hundred twenty billion, six hundred seventy-four million, six hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •