Base | Representation |
---|---|
bin | 11011101110000… |
… | …011000111000000 |
3 | 1012102002022011102 |
4 | 123232003013000 |
5 | 1423023244232 |
6 | 114051433532 |
7 | 14344624646 |
oct | 3356030700 |
9 | 1172068142 |
10 | 465056192 |
11 | 21956a667 |
12 | 10b8b58a8 |
13 | 7546baa3 |
14 | 45a9b196 |
15 | 2ac64662 |
hex | 1bb831c0 |
465056192 has 56 divisors (see below), whose sum is σ = 945824880. Its totient is φ = 226805760.
The previous prime is 465056171. The next prime is 465056197. The reversal of 465056192 is 291650564.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (465056197) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 542228 + ... + 543084.
It is an arithmetic number, because the mean of its divisors is an integer number (16889730).
Almost surely, 2465056192 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 465056192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (472912440).
465056192 is an abundant number, since it is smaller than the sum of its proper divisors (480768688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465056192 is a wasteful number, since it uses less digits than its factorization.
465056192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069 (or 1059 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 38.
The square root of 465056192 is about 21565.1615342895. The cubic root of 465056192 is about 774.7622951884.
The spelling of 465056192 in words is "four hundred sixty-five million, fifty-six thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •