Base | Representation |
---|---|
bin | 10100110111101… |
… | …001111000000000 |
3 | 220101211122020001 |
4 | 110313221320000 |
5 | 1204113240020 |
6 | 54424325344 |
7 | 11451042064 |
oct | 2467517000 |
9 | 811748201 |
10 | 350133760 |
11 | 16a706749 |
12 | 99313854 |
13 | 57702052 |
14 | 34703aa4 |
15 | 20b1350a |
hex | 14de9e00 |
350133760 has 80 divisors (see below), whose sum is σ = 844539696. Its totient is φ = 139214848.
The previous prime is 350133713. The next prime is 350133779. The reversal of 350133760 is 67331053.
350133760 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 596187 + ... + 596773.
Almost surely, 2350133760 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 350133760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (422269848).
350133760 is an abundant number, since it is smaller than the sum of its proper divisors (494405936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
350133760 is an equidigital number, since it uses as much as digits as its factorization.
350133760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843 (or 827 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 28.
The square root of 350133760 is about 18711.8614787519. The cubic root of 350133760 is about 704.8196376465.
The spelling of 350133760 in words is "three hundred fifty million, one hundred thirty-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •