Base | Representation |
---|---|
bin | 11100100110000… |
… | …011111110100000 |
3 | 1020102201022022001 |
4 | 130212003332200 |
5 | 1440303133213 |
6 | 115334253344 |
7 | 14613502222 |
oct | 3446037640 |
9 | 1212638261 |
10 | 479739808 |
11 | 226889689 |
12 | 1147b7254 |
13 | 78510412 |
14 | 47a00412 |
15 | 2c1b51dd |
hex | 1c983fa0 |
479739808 has 36 divisors (see below), whose sum is σ = 978417090. Its totient is φ = 231276416.
The previous prime is 479739803. The next prime is 479739823. The reversal of 479739808 is 808937974.
It can be written as a sum of positive squares in only one way, i.e., 405297424 + 74442384 = 20132^2 + 8628^2 .
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (479739803) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 666873 + ... + 667591.
Almost surely, 2479739808 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 479739808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (489208545).
479739808 is an abundant number, since it is smaller than the sum of its proper divisors (498677282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
479739808 is an frugal number, since it uses more digits than its factorization.
479739808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1477 (or 750 counting only the distinct ones).
The product of its (nonzero) digits is 3048192, while the sum is 55.
The square root of 479739808 is about 21902.9634524646. The cubic root of 479739808 is about 782.8320280463.
The spelling of 479739808 in words is "four hundred seventy-nine million, seven hundred thirty-nine thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •