Base | Representation |
---|---|
bin | 10011010000101… |
… | …001001100000001 |
3 | 211112000201011222 |
4 | 103100221030001 |
5 | 1130210130423 |
6 | 52021444425 |
7 | 11002363205 |
oct | 2320511401 |
9 | 745021158 |
10 | 323130113 |
11 | 156442489 |
12 | 90270715 |
13 | 51c38b67 |
14 | 30cb4b05 |
15 | 1d57c3c8 |
hex | 13429301 |
323130113 has 4 divisors (see below), whose sum is σ = 323831508. Its totient is φ = 322428720.
The previous prime is 323130097. The next prime is 323130133. The reversal of 323130113 is 311031323.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 60949249 + 262180864 = 7807^2 + 16192^2 .
It is a cyclic number.
It is not a de Polignac number, because 323130113 - 24 = 323130097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 323130091 and 323130100.
It is not an unprimeable number, because it can be changed into a prime (323130133) 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, 350006 + ... + 350927.
It is an arithmetic number, because the mean of its divisors is an integer number (80957877).
Almost surely, 2323130113 is an apocalyptic number.
It is an amenable number.
323130113 is a deficient number, since it is larger than the sum of its proper divisors (701395).
323130113 is an equidigital number, since it uses as much as digits as its factorization.
323130113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701394.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 323130113 is about 17975.8202316334. The cubic root of 323130113 is about 686.2133205125.
Adding to 323130113 its reverse (311031323), we get a palindrome (634161436).
The spelling of 323130113 in words is "three hundred twenty-three million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •