Base | Representation |
---|---|
bin | 10100110111010… |
… | …101010011001000 |
3 | 220101200100121120 |
4 | 110313111103020 |
5 | 1204103040410 |
6 | 54422435240 |
7 | 11450241264 |
oct | 2467252310 |
9 | 811610546 |
10 | 350049480 |
11 | 16a6593a0 |
12 | 99292b20 |
13 | 576a2891 |
14 | 346c10a4 |
15 | 20ae8570 |
hex | 14dd54c8 |
350049480 has 128 divisors (see below), whose sum is σ = 1150070400. Its totient is φ = 84531200.
The previous prime is 350049463. The next prime is 350049487. The reversal of 350049480 is 84940053.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (350049487) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 671620 + ... + 672140.
It is an arithmetic number, because the mean of its divisors is an integer number (8984925).
Almost surely, 2350049480 is an apocalyptic number.
350049480 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 350049480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (575035200).
350049480 is an abundant number, since it is smaller than the sum of its proper divisors (800020920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350049480 is a wasteful number, since it uses less digits than its factorization.
350049480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1055 (or 1051 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 350049480 is about 18709.6092957603. The cubic root of 350049480 is about 704.7630811980.
The spelling of 350049480 in words is "three hundred fifty million, forty-nine thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •