Base | Representation |
---|---|
bin | 10110110011000… |
… | …01110000010000 |
3 | 111022212001122121 |
4 | 23121201300100 |
5 | 342424204412 |
6 | 30550544024 |
7 | 4511344420 |
oct | 1331416020 |
9 | 438761577 |
10 | 191241232 |
11 | 98a50406 |
12 | 54068014 |
13 | 3080b6c0 |
14 | 1b582480 |
15 | 11bc9107 |
hex | b661c10 |
191241232 has 160 divisors (see below), whose sum is σ = 497745920. Its totient is φ = 69050880.
The previous prime is 191241209. The next prime is 191241257. The reversal of 191241232 is 232142191.
It is a junction number, because it is equal to n+sod(n) for n = 191241197 and 191241206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 857473 + ... + 857695.
It is an arithmetic number, because the mean of its divisors is an integer number (3110912).
Almost surely, 2191241232 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 191241232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248872960).
191241232 is an abundant number, since it is smaller than the sum of its proper divisors (306504688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
191241232 is a wasteful number, since it uses less digits than its factorization.
191241232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301 (or 295 counting only the distinct ones).
The product of its digits is 864, while the sum is 25.
The square root of 191241232 is about 13828.9996745969. Note that the first 3 decimals coincide. The cubic root of 191241232 is about 576.1388714799.
The spelling of 191241232 in words is "one hundred ninety-one million, two hundred forty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •