Base | Representation |
---|---|
bin | 10100101000101… |
… | …110100001110100 |
3 | 220010110211110102 |
4 | 110220232201310 |
5 | 1202113030120 |
6 | 54204413232 |
7 | 11402553452 |
oct | 2450564164 |
9 | 803424412 |
10 | 346220660 |
11 | 168483785 |
12 | 97b47218 |
13 | 56961bc6 |
14 | 33da59d2 |
15 | 205ddd75 |
hex | 14a2e874 |
346220660 has 72 divisors (see below), whose sum is σ = 778337280. Its totient is φ = 129325248.
The previous prime is 346220629. The next prime is 346220663. The reversal of 346220660 is 66022643.
346220660 = T2921 + T2922 + ... + T2999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (346220663) 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 23 ways as a sum of consecutive naturals, for example, 570077 + ... + 570683.
It is an arithmetic number, because the mean of its divisors is an integer number (10810240).
Almost surely, 2346220660 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 346220660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (389168640).
346220660 is an abundant number, since it is smaller than the sum of its proper divisors (432116620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346220660 is a wasteful number, since it uses less digits than its factorization.
346220660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733 (or 712 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
The square root of 346220660 is about 18607.0056699083. The cubic root of 346220660 is about 702.1841033575.
The spelling of 346220660 in words is "three hundred forty-six million, two hundred twenty thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •