Base | Representation |
---|---|
bin | 11011101110101… |
… | …100111100010100 |
3 | 1012102102000012122 |
4 | 123232230330110 |
5 | 1423044240130 |
6 | 114055235112 |
7 | 14346240341 |
oct | 3356547424 |
9 | 1172360178 |
10 | 465227540 |
11 | 219677378 |
12 | 10b978a98 |
13 | 754cba8b |
14 | 45b037c8 |
15 | 2ac9a2e5 |
hex | 1bbacf14 |
465227540 has 96 divisors (see below), whose sum is σ = 1078103040. Its totient is φ = 167961600.
The previous prime is 465227531. The next prime is 465227557. The reversal of 465227540 is 45722564.
It is a self number, because there is not a number n which added to its sum of digits gives 465227540.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 859670 + ... + 860210.
It is an arithmetic number, because the mean of its divisors is an integer number (11230240).
Almost surely, 2465227540 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 465227540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (539051520).
465227540 is an abundant number, since it is smaller than the sum of its proper divisors (612875500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465227540 is a wasteful number, since it uses less digits than its factorization.
465227540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673 (or 671 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 35.
The square root of 465227540 is about 21569.1339649973. The cubic root of 465227540 is about 774.8574361421.
The spelling of 465227540 in words is "four hundred sixty-five million, two hundred twenty-seven thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •