Base | Representation |
---|---|
bin | 11011101111000… |
… | …100001100000000 |
3 | 1012102120211211000 |
4 | 123233010030000 |
5 | 1423110312002 |
6 | 114101252000 |
7 | 14350115046 |
oct | 3357041400 |
9 | 1172524730 |
10 | 465322752 |
11 | 219731964 |
12 | 10ba04000 |
13 | 7553320b |
14 | 45b2a396 |
15 | 2acb861c |
hex | 1bbc4300 |
465322752 has 144 divisors (see below), whose sum is σ = 1436359680. Its totient is φ = 148313088.
The previous prime is 465322717. The next prime is 465322769. The reversal of 465322752 is 257223564.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157513 + ... + 160439.
It is an arithmetic number, because the mean of its divisors is an integer number (9974720).
Almost surely, 2465322752 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 465322752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (718179840).
465322752 is an abundant number, since it is smaller than the sum of its proper divisors (971036928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465322752 is a wasteful number, since it uses less digits than its factorization.
465322752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2975 (or 2955 counting only the distinct ones).
The product of its digits is 100800, while the sum is 36.
The square root of 465322752 is about 21571.3409875232. The cubic root of 465322752 is about 774.9102924956.
It can be divided in two parts, 46532 and 2752, that added together give a square (49284 = 2222).
The spelling of 465322752 in words is "four hundred sixty-five million, three hundred twenty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •