Base | Representation |
---|---|
bin | 100100011001010000010010… |
… | …0111111111000010001101101 |
3 | 1112222111011021020200102012002 |
4 | 1020302200210333320101231 |
5 | 313430003330043200023 |
6 | 3052505455254022045 |
7 | 124300436225546600 |
oct | 11062404477702155 |
9 | 1488434236612162 |
10 | 320130303100013 |
11 | 9300455435816a |
12 | 2baa3492947925 |
13 | 109822093051a3 |
14 | 590a5644dc337 |
15 | 27024cce7ab28 |
hex | 1232824ff846d |
320130303100013 has 24 divisors (see below), whose sum is σ = 373914903196800. Its totient is φ = 273278764248000.
The previous prime is 320130303100009. The next prime is 320130303100033. The reversal of 320130303100013 is 310001303031023.
It is not a de Polignac number, because 320130303100013 - 22 = 320130303100009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320130303100033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 131611745 + ... + 134022057.
It is an arithmetic number, because the mean of its divisors is an integer number (15579787633200).
Almost surely, 2320130303100013 is an apocalyptic number.
It is an amenable number.
320130303100013 is a deficient number, since it is larger than the sum of its proper divisors (53784600096787).
320130303100013 is a wasteful number, since it uses less digits than its factorization.
320130303100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2421377 (or 2421370 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 320130303100013 its reverse (310001303031023), we get a palindrome (630131606131036).
The spelling of 320130303100013 in words is "three hundred twenty trillion, one hundred thirty billion, three hundred three million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •