Base | Representation |
---|---|
bin | 1011111011111110000 |
3 | 201212120010 |
4 | 1133133300 |
5 | 100004102 |
6 | 12214520 |
7 | 3216246 |
oct | 1373760 |
9 | 655503 |
10 | 391152 |
11 | 247973 |
12 | 16a440 |
13 | 109068 |
14 | a2796 |
15 | 7ad6c |
hex | 5f7f0 |
391152 has 40 divisors (see below), whose sum is σ = 1049040. Its totient is φ = 125440.
The previous prime is 391151. The next prime is 391159. The reversal of 391152 is 251193.
391152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 391152.
It is not an unprimeable number, because it can be changed into a prime (391151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1252 + ... + 1532.
It is an arithmetic number, because the mean of its divisors is an integer number (26226).
2391152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 391152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (524520).
391152 is an abundant number, since it is smaller than the sum of its proper divisors (657888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
391152 is a wasteful number, since it uses less digits than its factorization.
391152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321 (or 315 counting only the distinct ones).
The product of its digits is 270, while the sum is 21.
The square root of 391152 is about 625.4214578986. The cubic root of 391152 is about 73.1333024396.
The spelling of 391152 in words is "three hundred ninety-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •