Base | Representation |
---|---|
bin | 10100101110000… |
… | …110110101010000 |
3 | 220020010110222120 |
4 | 110232012311100 |
5 | 1202443142203 |
6 | 54254534240 |
7 | 11420546151 |
oct | 2456066520 |
9 | 806113876 |
10 | 347630928 |
11 | 169257297 |
12 | 98507380 |
13 | 57036a98 |
14 | 34251928 |
15 | 207bbb53 |
hex | 14b86d50 |
347630928 has 80 divisors (see below), whose sum is σ = 914316480. Its totient is φ = 113799168.
The previous prime is 347630903. The next prime is 347630939. The reversal of 347630928 is 829036743.
It is a self number, because there is not a number n which added to its sum of digits gives 347630928.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 917043 + ... + 917421.
It is an arithmetic number, because the mean of its divisors is an integer number (11428956).
Almost surely, 2347630928 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 347630928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (457158240).
347630928 is an abundant number, since it is smaller than the sum of its proper divisors (566685552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
347630928 is a wasteful number, since it uses less digits than its factorization.
347630928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684 (or 678 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 42.
The square root of 347630928 is about 18644.8633140605. The cubic root of 347630928 is about 703.1362189301.
The spelling of 347630928 in words is "three hundred forty-seven million, six hundred thirty thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •