Base | Representation |
---|---|
bin | 11011101101001… |
… | …100100000110000 |
3 | 1012101122221101202 |
4 | 123231030200300 |
5 | 1422444120220 |
6 | 114042550332 |
7 | 14343003653 |
oct | 3355144060 |
9 | 1171587352 |
10 | 464832560 |
11 | 219427645 |
12 | 10b8083a8 |
13 | 753c106a |
14 | 45a3d89a |
15 | 2ac1d275 |
hex | 1bb4c830 |
464832560 has 20 divisors (see below), whose sum is σ = 1080735888. Its totient is φ = 185932992.
The previous prime is 464832497. The next prime is 464832593. The reversal of 464832560 is 65238464.
464832560 is digitally balanced in base 6, 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 (20).
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
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 3 ways as a sum of consecutive naturals, for example, 2905124 + ... + 2905283.
Almost surely, 2464832560 is an apocalyptic number.
464832560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
464832560 is an abundant number, since it is smaller than the sum of its proper divisors (615903328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
464832560 is a wasteful number, since it uses less digits than its factorization.
464832560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5810420 (or 5810414 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The square root of 464832560 is about 21559.9758812481. The cubic root of 464832560 is about 774.6380883906.
The spelling of 464832560 in words is "four hundred sixty-four million, eight hundred thirty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •