Base | Representation |
---|---|
bin | 10100110001110… |
… | …011111101111000 |
3 | 220021221211100210 |
4 | 110301303331320 |
5 | 1203220232412 |
6 | 54331431120 |
7 | 11432033016 |
oct | 2461637570 |
9 | 807854323 |
10 | 348602232 |
11 | 169860020 |
12 | 988b54a0 |
13 | 572b6c14 |
14 | 344258b6 |
15 | 2090e83c |
hex | 14c73f78 |
348602232 has 64 divisors (see below), whose sum is σ = 956684160. Its totient is φ = 104976000.
The previous prime is 348602203. The next prime is 348602263. The reversal of 348602232 is 232206843.
It is a self number, because there is not a number n which added to its sum of digits gives 348602232.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 38982 + ... + 47082.
It is an arithmetic number, because the mean of its divisors is an integer number (14948190).
Almost surely, 2348602232 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 348602232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (478342080).
348602232 is an abundant number, since it is smaller than the sum of its proper divisors (608081928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
348602232 is a wasteful number, since it uses less digits than its factorization.
348602232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8284 (or 8280 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
The square root of 348602232 is about 18670.8926406854. The cubic root of 348602232 is about 703.7904797902.
The spelling of 348602232 in words is "three hundred forty-eight million, six hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •