Base | Representation |
---|---|
bin | 10011010000011… |
… | …111001111110101 |
3 | 211111221122022222 |
4 | 103100133033311 |
5 | 1130202330042 |
6 | 52020532125 |
7 | 11002133411 |
oct | 2320371765 |
9 | 744848288 |
10 | 323089397 |
11 | 156414934 |
12 | 90251045 |
13 | 51c23477 |
14 | 30ca3d41 |
15 | 1d5702d2 |
hex | 1341f3f5 |
323089397 has 4 divisors (see below), whose sum is σ = 325633536. Its totient is φ = 320545260.
The previous prime is 323089391. The next prime is 323089411. The reversal of 323089397 is 793980323.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 793980323 = 149 ⋅5328727.
It is a cyclic number.
It is not a de Polignac number, because 323089397 - 226 = 255980533 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 (323089391) 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, 1271879 + ... + 1272132.
It is an arithmetic number, because the mean of its divisors is an integer number (81408384).
Almost surely, 2323089397 is an apocalyptic number.
It is an amenable number.
323089397 is a deficient number, since it is larger than the sum of its proper divisors (2544139).
323089397 is a wasteful number, since it uses less digits than its factorization.
323089397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2544138.
The product of its (nonzero) digits is 244944, while the sum is 44.
The square root of 323089397 is about 17974.6876746162. The cubic root of 323089397 is about 686.1844972057.
The spelling of 323089397 in words is "three hundred twenty-three million, eighty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •