Base | Representation |
---|---|
bin | 10011011101110… |
… | …000011110111100 |
3 | 211202111100220020 |
4 | 103131300132330 |
5 | 1132100132433 |
6 | 52223252140 |
7 | 11043531624 |
oct | 2335603674 |
9 | 752440806 |
10 | 326567868 |
11 | 158380300 |
12 | 9144a050 |
13 | 52870833 |
14 | 3152b884 |
15 | 1da0acb3 |
hex | 137707bc |
326567868 has 36 divisors (see below), whose sum is σ = 837564840. Its totient is φ = 98959520.
The previous prime is 326567861. The next prime is 326567893. The reversal of 326567868 is 868765623.
326567868 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 326567868.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (326567861) 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 11 ways as a sum of consecutive naturals, for example, 111003 + ... + 113906.
It is an arithmetic number, because the mean of its divisors is an integer number (23265690).
Almost surely, 2326567868 is an apocalyptic number.
It is an amenable number.
326567868 is an abundant number, since it is smaller than the sum of its proper divisors (510996972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
326567868 is a wasteful number, since it uses less digits than its factorization.
326567868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224938 (or 224925 counting only the distinct ones).
The product of its digits is 2903040, while the sum is 51.
The square root of 326567868 is about 18071.1888928205. The cubic root of 326567868 is about 688.6382637197.
The spelling of 326567868 in words is "three hundred twenty-six million, five hundred sixty-seven thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •