Base | Representation |
---|---|
bin | 11011101010001… |
… | …101011110100000 |
3 | 1012100012012001000 |
4 | 123222031132200 |
5 | 1422244100310 |
6 | 114014112000 |
7 | 14333234454 |
oct | 3352153640 |
9 | 1170165030 |
10 | 464050080 |
11 | 218a4276a |
12 | 10b4ab600 |
13 | 751a8b60 |
14 | 458b8664 |
15 | 2ab164c0 |
hex | 1ba8d7a0 |
464050080 has 192 divisors, whose sum is σ = 1749323520. Its totient is φ = 114213888.
The previous prime is 464050057. The next prime is 464050121. The reversal of 464050080 is 80050464.
464050080 is a `hidden beast` number, since 46 + 40 + 500 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52029 + ... + 60291.
It is an arithmetic number, because the mean of its divisors is an integer number (9111060).
Almost surely, 2464050080 is an apocalyptic number.
464050080 is a gapful number since it is divisible by the number (40) 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 464050080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (874661760).
464050080 is an abundant number, since it is smaller than the sum of its proper divisors (1285273440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
464050080 is a wasteful number, since it uses less digits than its factorization.
464050080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8300 (or 8286 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 464050080 is about 21541.8216499905. The cubic root of 464050080 is about 774.2031796382.
The spelling of 464050080 in words is "four hundred sixty-four million, fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •