Base | Representation |
---|---|
bin | 10100111000001… |
… | …001100101100000 |
3 | 220102002020101201 |
4 | 110320021211200 |
5 | 1204131414043 |
6 | 54431210544 |
7 | 11452122550 |
oct | 2470114540 |
9 | 812066351 |
10 | 350263648 |
11 | 16a795299 |
12 | 99376a54 |
13 | 577491c7 |
14 | 34739160 |
15 | 20b3bc4d |
hex | 14e09960 |
350263648 has 96 divisors (see below), whose sum is σ = 849139200. Its totient is φ = 138799104.
The previous prime is 350263633. The next prime is 350263673. The reversal of 350263648 is 846362053.
It is a super-2 number, since 2×3502636482 = 245369246220535808, 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 15 ways as a sum of consecutive naturals, for example, 223893 + ... + 225451.
It is an arithmetic number, because the mean of its divisors is an integer number (8845200).
Almost surely, 2350263648 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 350263648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (424569600).
350263648 is an abundant number, since it is smaller than the sum of its proper divisors (498875552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350263648 is a wasteful number, since it uses less digits than its factorization.
350263648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1652 (or 1644 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
The square root of 350263648 is about 18715.3318966028. The cubic root of 350263648 is about 704.9067817663.
The spelling of 350263648 in words is "three hundred fifty million, two hundred sixty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •