Base | Representation |
---|---|
bin | 100100011001010001001000… |
… | …1111010001000110010001111 |
3 | 1112222111022222120220100212121 |
4 | 1020302202101322020302033 |
5 | 313430021100324430221 |
6 | 3052510400445313411 |
7 | 124300532423566333 |
oct | 11062422172106217 |
9 | 1488438876810777 |
10 | 320132130311311 |
11 | 9300530180804a |
12 | 2baa3902865867 |
13 | 1098243aa31ac6 |
14 | 590a6990597c3 |
15 | 27025885aba41 |
hex | 1232891e88c8f |
320132130311311 has 4 divisors (see below), whose sum is σ = 336981189801400. Its totient is φ = 303283070821224.
The previous prime is 320132130311303. The next prime is 320132130311327. The reversal of 320132130311311 is 113113031231023.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 320132130311311 - 23 = 320132130311303 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 (320132130311011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8424529745016 + ... + 8424529745053.
It is an arithmetic number, because the mean of its divisors is an integer number (84245297450350).
Almost surely, 2320132130311311 is an apocalyptic number.
320132130311311 is a deficient number, since it is larger than the sum of its proper divisors (16849059490089).
320132130311311 is a wasteful number, since it uses less digits than its factorization.
320132130311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16849059490088.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 320132130311311 its reverse (113113031231023), we get a palindrome (433245161542334).
The spelling of 320132130311311 in words is "three hundred twenty trillion, one hundred thirty-two billion, one hundred thirty million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •