Base | Representation |
---|---|
bin | 10011010000001… |
… | …110010101100011 |
3 | 211111211010022120 |
4 | 103100032111203 |
5 | 1130143121011 |
6 | 52015235323 |
7 | 11001424440 |
oct | 2320162543 |
9 | 744733276 |
10 | 323020131 |
11 | 156377895 |
12 | 90218b43 |
13 | 51bcaa95 |
14 | 30c869c7 |
15 | 1d559a06 |
hex | 1340e563 |
323020131 has 8 divisors (see below), whose sum is σ = 492221184. Its totient is φ = 184582920.
The previous prime is 323020129. The next prime is 323020141. The reversal of 323020131 is 131020323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 323020131 - 21 = 323020129 is a prime.
It is a super-2 number, since 2×3230201312 = 208684010062514322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 323020131.
It is not an unprimeable number, because it can be changed into a prime (323020141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7690935 + ... + 7690976.
It is an arithmetic number, because the mean of its divisors is an integer number (61527648).
Almost surely, 2323020131 is an apocalyptic number.
323020131 is a deficient number, since it is larger than the sum of its proper divisors (169201053).
323020131 is a wasteful number, since it uses less digits than its factorization.
323020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15381921.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 323020131 is about 17972.7608062868. The cubic root of 323020131 is about 686.1354574737.
Adding to 323020131 its reverse (131020323), we get a palindrome (454040454).
The spelling of 323020131 in words is "three hundred twenty-three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •