Base | Representation |
---|---|
bin | 10011011100000… |
… | …110100100001111 |
3 | 211201200022210012 |
4 | 103130012210033 |
5 | 1131442242111 |
6 | 52210103435 |
7 | 11040044036 |
oct | 2334064417 |
9 | 751608705 |
10 | 326134031 |
11 | 158104363 |
12 | 9127ab7b |
13 | 5274b222 |
14 | 3145771d |
15 | 1d97248b |
hex | 1370690f |
326134031 has 8 divisors (see below), whose sum is σ = 345606000. Its totient is φ = 306892800.
The previous prime is 326134013. The next prime is 326134057. The reversal of 326134031 is 130431623.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 326134031 - 210 = 326133007 is a prime.
It is a super-2 number, since 2×3261340312 = 212726812352617922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 326133988 and 326134006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (326134531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54770 + ... + 60431.
It is an arithmetic number, because the mean of its divisors is an integer number (43200750).
Almost surely, 2326134031 is an apocalyptic number.
326134031 is a deficient number, since it is larger than the sum of its proper divisors (19471969).
326134031 is a wasteful number, since it uses less digits than its factorization.
326134031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115369.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 326134031 is about 18059.1813491088. The cubic root of 326134031 is about 688.3331825178. Note that the first 3 decimals are identical.
Adding to 326134031 its reverse (130431623), we get a palindrome (456565654).
The spelling of 326134031 in words is "three hundred twenty-six million, one hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •