Base | Representation |
---|---|
bin | 10100110111101… |
… | …111011101110000 |
3 | 220101212210122001 |
4 | 110313233131300 |
5 | 1204120003111 |
6 | 54425023344 |
7 | 11451165613 |
oct | 2467573560 |
9 | 811783561 |
10 | 350156656 |
11 | 16a721973 |
12 | 99324b54 |
13 | 5770c5b5 |
14 | 3470c17a |
15 | 20b1a1c1 |
hex | 14def770 |
350156656 has 40 divisors (see below), whose sum is σ = 705561984. Its totient is φ = 168161280.
The previous prime is 350156621. The next prime is 350156657. The reversal of 350156656 is 656651053.
It is a happy number.
It is a super-2 number, since 2×3501566562 = 245219367482204672, which contains 22 as substring.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (350156657) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65376 + ... + 70528.
Almost surely, 2350156656 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 350156656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (352780992).
350156656 is an abundant number, since it is smaller than the sum of its proper divisors (355405328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350156656 is a wasteful number, since it uses less digits than its factorization.
350156656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5329 (or 5323 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The square root of 350156656 is about 18712.4732731940. The cubic root of 350156656 is about 704.8350005358.
The spelling of 350156656 in words is "three hundred fifty million, one hundred fifty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •