Base | Representation |
---|---|
bin | 10011011111011… |
… | …101011001100010 |
3 | 211210100000212010 |
4 | 103133131121202 |
5 | 1132203421421 |
6 | 52241013350 |
7 | 11050400355 |
oct | 2337353142 |
9 | 753300763 |
10 | 327013986 |
11 | 1586554a2 |
12 | 91624256 |
13 | 52998900 |
14 | 3160629c |
15 | 1da98076 |
hex | 137dd662 |
327013986 has 48 divisors (see below), whose sum is σ = 710713440. Its totient is φ = 100264320.
The previous prime is 327013969. The next prime is 327013987. The reversal of 327013986 is 689310723.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (327013987) 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 23 ways as a sum of consecutive naturals, for example, 527985 + ... + 528603.
It is an arithmetic number, because the mean of its divisors is an integer number (14806530).
Almost surely, 2327013986 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 327013986, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (355356720).
327013986 is an abundant number, since it is smaller than the sum of its proper divisors (383699454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
327013986 is a wasteful number, since it uses less digits than its factorization.
327013986 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171 (or 1158 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 39.
The square root of 327013986 is about 18083.5280296739. The cubic root of 327013986 is about 688.9516994740.
The spelling of 327013986 in words is "three hundred twenty-seven million, thirteen thousand, nine hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •