Base | Representation |
---|---|
bin | 10111011011011… |
… | …000101101101000 |
3 | 1000101121021012120 |
4 | 113123120231220 |
5 | 1301110230310 |
6 | 103000311240 |
7 | 12511625115 |
oct | 2733305550 |
9 | 1011537176 |
10 | 393055080 |
11 | 191962110 |
12 | ab772520 |
13 | 6357c492 |
14 | 3a2b790c |
15 | 24790b70 |
hex | 176d8b68 |
393055080 has 128 divisors (see below), whose sum is σ = 1293926400. Its totient is φ = 94726400.
The previous prime is 393055063. The next prime is 393055087. The reversal of 393055080 is 80550393.
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 (393055087) 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, 251341 + ... + 252899.
It is an arithmetic number, because the mean of its divisors is an integer number (10108800).
Almost surely, 2393055080 is an apocalyptic number.
393055080 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 393055080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (646963200).
393055080 is an abundant number, since it is smaller than the sum of its proper divisors (900871320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
393055080 is a wasteful number, since it uses less digits than its factorization.
393055080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1775 (or 1771 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 33.
The square root of 393055080 is about 19825.6167621590. The cubic root of 393055080 is about 732.5171626788.
The spelling of 393055080 in words is "three hundred ninety-three million, fifty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •