Base | Representation |
---|---|
bin | 10011100011100… |
… | …110110111001111 |
3 | 211212101021102000 |
4 | 103203212313033 |
5 | 1132443220302 |
6 | 52320203343 |
7 | 11062546431 |
oct | 2343466717 |
9 | 755337360 |
10 | 328101327 |
11 | 159228424 |
12 | 91a69553 |
13 | 52c897c8 |
14 | 3180a651 |
15 | 1dc1031c |
hex | 138e6dcf |
328101327 has 8 divisors (see below), whose sum is σ = 486076080. Its totient is φ = 218734200.
The previous prime is 328101317. The next prime is 328101359. The reversal of 328101327 is 723101823.
328101327 is a `hidden beast` number, since 328 + 10 + 1 + 327 = 666.
It is not a de Polignac number, because 328101327 - 211 = 328099279 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 12151901 = 328101327 / (3 + 2 + 8 + 1 + 0 + 1 + 3 + 2 + 7).
It is a self number, because there is not a number n which added to its sum of digits gives 328101327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (328101317) 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, 6075924 + ... + 6075977.
It is an arithmetic number, because the mean of its divisors is an integer number (60759510).
Almost surely, 2328101327 is an apocalyptic number.
328101327 is a deficient number, since it is larger than the sum of its proper divisors (157974753).
328101327 is a wasteful number, since it uses less digits than its factorization.
328101327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12151910 (or 12151904 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 328101327 is about 18113.5674840712. The cubic root of 328101327 is about 689.7144565187.
The spelling of 328101327 in words is "three hundred twenty-eight million, one hundred one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •