Base | Representation |
---|---|
bin | 10100110111011… |
… | …001010000000000 |
3 | 220101201011210222 |
4 | 110313121100000 |
5 | 1204104100124 |
6 | 54423042212 |
7 | 11450336414 |
oct | 2467312000 |
9 | 811634728 |
10 | 350065664 |
11 | 16a66a573 |
12 | 992a0368 |
13 | 576aa060 |
14 | 346c6d44 |
15 | 20aed25e |
hex | 14dd9400 |
350065664 has 44 divisors (see below), whose sum is σ = 753648084. Its totient is φ = 161562624.
The previous prime is 350065619. The next prime is 350065679. The reversal of 350065664 is 466560053.
It can be written as a sum of positive squares in 2 ways, for example, as 104203264 + 245862400 = 10208^2 + 15680^2 .
It is a super-2 number, since 2×3500656642 = 245091938223521792, which contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 164 + ... + 26460.
Almost surely, 2350065664 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 350065664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (376824042).
350065664 is an abundant number, since it is smaller than the sum of its proper divisors (403582420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350065664 is a wasteful number, since it uses less digits than its factorization.
350065664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26330 (or 26312 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
The square root of 350065664 is about 18710.0417957844. The cubic root of 350065664 is about 704.7739422434.
The spelling of 350065664 in words is "three hundred fifty million, sixty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •