Base | Representation |
---|---|
bin | 11011110011001… |
… | …010100100101100 |
3 | 1012111121110001220 |
4 | 123303022210230 |
5 | 1423344204414 |
6 | 114140303340 |
7 | 14362212300 |
oct | 3363124454 |
9 | 1174543056 |
10 | 466397484 |
11 | 21a2a6373 |
12 | 110241b50 |
13 | 7581b457 |
14 | 45d29d00 |
15 | 2ae2bca9 |
hex | 1bcca92c |
466397484 has 144 divisors (see below), whose sum is σ = 1348300800. Its totient is φ = 124758144.
The previous prime is 466397483. The next prime is 466397489. The reversal of 466397484 is 484793664.
It is a super-2 number, since 2×4663974842 = 435053226163060512, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (466397483) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1217557 + ... + 1217939.
It is an arithmetic number, because the mean of its divisors is an integer number (9363200).
Almost surely, 2466397484 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 466397484, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (674150400).
466397484 is an abundant number, since it is smaller than the sum of its proper divisors (881903316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
466397484 is a wasteful number, since it uses less digits than its factorization.
466397484 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532 (or 523 counting only the distinct ones).
The product of its digits is 3483648, while the sum is 51.
The square root of 466397484 is about 21596.2377279007. The cubic root of 466397484 is about 775.5064239132.
The spelling of 466397484 in words is "four hundred sixty-six million, three hundred ninety-seven thousand, four hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •