Base | Representation |
---|---|
bin | 10011011011100… |
… | …111000101000101 |
3 | 211201102202212112 |
4 | 103123213011011 |
5 | 1131424130221 |
6 | 52203230405 |
7 | 11035666034 |
oct | 2333470505 |
9 | 751382775 |
10 | 326005061 |
11 | 158026478 |
12 | 91218405 |
13 | 52704605 |
14 | 3142271b |
15 | 1d94915b |
hex | 136e7145 |
326005061 has 4 divisors (see below), whose sum is σ = 326136000. Its totient is φ = 325874124.
The previous prime is 326005033. The next prime is 326005081. The reversal of 326005061 is 160500623.
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: 160500623 = 12391 ⋅12953.
It is a cyclic number.
It is not a de Polignac number, because 326005061 - 218 = 325742917 is a prime.
It is a super-2 number, since 2×3260050612 = 212558599595227442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (326005081) 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, 61661 + ... + 66738.
It is an arithmetic number, because the mean of its divisors is an integer number (81534000).
Almost surely, 2326005061 is an apocalyptic number.
It is an amenable number.
326005061 is a deficient number, since it is larger than the sum of its proper divisors (130939).
326005061 is a wasteful number, since it uses less digits than its factorization.
326005061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130938.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 326005061 is about 18055.6102361565. The cubic root of 326005061 is about 688.2424365600.
Adding to 326005061 its reverse (160500623), we get a palindrome (486505684).
The spelling of 326005061 in words is "three hundred twenty-six million, five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •