Base | Representation |
---|---|
bin | 1001011010000000100… |
… | …10011001110010001111 |
3 | 1010220020102220200211011 |
4 | 10231000102121302033 |
5 | 20243403441110411 |
6 | 404250533310051 |
7 | 32231140064023 |
oct | 4550022316217 |
9 | 1126212820734 |
10 | 323201113231 |
11 | 11508366a047 |
12 | 5277b495327 |
13 | 24629774989 |
14 | 11900622383 |
15 | 8619497c21 |
hex | 4b40499c8f |
323201113231 has 4 divisors (see below), whose sum is σ = 324875730592. Its totient is φ = 321526495872.
The previous prime is 323201113189. The next prime is 323201113267. The reversal of 323201113231 is 132311102323.
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 323201113231 - 211 = 323201111183 is a prime.
It is a super-2 number, since 2×3232011132312 (a number of 24 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 (323201113031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 837308391 + ... + 837308776.
It is an arithmetic number, because the mean of its divisors is an integer number (81218932648).
Almost surely, 2323201113231 is an apocalyptic number.
323201113231 is a deficient number, since it is larger than the sum of its proper divisors (1674617361).
323201113231 is a wasteful number, since it uses less digits than its factorization.
323201113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1674617360.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 323201113231 its reverse (132311102323), we get a palindrome (455512215554).
The spelling of 323201113231 in words is "three hundred twenty-three billion, two hundred one million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •