Base | Representation |
---|---|
bin | 10011010001110… |
… | …001001101110101 |
3 | 211112120200212221 |
4 | 103101301031311 |
5 | 1130244101031 |
6 | 52032042341 |
7 | 11005032304 |
oct | 2321611565 |
9 | 745520787 |
10 | 323425141 |
11 | 156624106 |
12 | 903933b1 |
13 | 52010230 |
14 | 30d5043b |
15 | 1d5d9a11 |
hex | 13471375 |
323425141 has 4 divisors (see below), whose sum is σ = 348304012. Its totient is φ = 298546272.
The previous prime is 323425073. The next prime is 323425159. The reversal of 323425141 is 141524323.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141524323 = 523 ⋅270601.
It can be written as a sum of positive squares in 2 ways, for example, as 107952100 + 215473041 = 10390^2 + 14679^2 .
It is a cyclic number.
It is not a de Polignac number, because 323425141 - 213 = 323416949 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 (323425441) 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, 12439416 + ... + 12439441.
It is an arithmetic number, because the mean of its divisors is an integer number (87076003).
Almost surely, 2323425141 is an apocalyptic number.
It is an amenable number.
323425141 is a deficient number, since it is larger than the sum of its proper divisors (24878871).
323425141 is a wasteful number, since it uses less digits than its factorization.
323425141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24878870.
The product of its digits is 2880, while the sum is 25.
The square root of 323425141 is about 17984.0246051878. The cubic root of 323425141 is about 686.4221017965.
Adding to 323425141 its reverse (141524323), we get a palindrome (464949464).
The spelling of 323425141 in words is "three hundred twenty-three million, four hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •