Base | Representation |
---|---|
bin | 10011011100110… |
… | …010110110100111 |
3 | 211202000112121201 |
4 | 103130302312213 |
5 | 1132014043211 |
6 | 52214023331 |
7 | 11041430641 |
oct | 2334626647 |
9 | 752015551 |
10 | 326315431 |
11 | 158218682 |
12 | 91347b47 |
13 | 527b2970 |
14 | 314a3891 |
15 | 1d9ab0c1 |
hex | 13732da7 |
326315431 has 4 divisors (see below), whose sum is σ = 351416632. Its totient is φ = 301214232.
The previous prime is 326315419. The next prime is 326315441. The reversal of 326315431 is 134513623.
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 326315431 - 219 = 325791143 is a prime.
It is a super-2 number, since 2×3263154312 = 212963521017431522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 326315431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (326315401) 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, 12550581 + ... + 12550606.
It is an arithmetic number, because the mean of its divisors is an integer number (87854158).
Almost surely, 2326315431 is an apocalyptic number.
326315431 is a deficient number, since it is larger than the sum of its proper divisors (25101201).
326315431 is a wasteful number, since it uses less digits than its factorization.
326315431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25101200.
The product of its digits is 6480, while the sum is 28.
The square root of 326315431 is about 18064.2030269813. The cubic root of 326315431 is about 688.4607788272.
The spelling of 326315431 in words is "three hundred twenty-six million, three hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •