Base | Representation |
---|---|
bin | 11010110110011… |
… | …101100101010110 |
3 | 1011101122222122120 |
4 | 122312131211112 |
5 | 1410311001231 |
6 | 112411240410 |
7 | 14110025040 |
oct | 3266354526 |
9 | 1141588576 |
10 | 450484566 |
11 | 2113177a4 |
12 | 106a49106 |
13 | 7243941c |
14 | 43b86a90 |
15 | 29836d96 |
hex | 1ad9d956 |
450484566 has 64 divisors (see below), whose sum is σ = 1107025920. Its totient is φ = 119331360.
The previous prime is 450484553. The next prime is 450484597. The reversal of 450484566 is 665484054.
It is a super-3 number, since 3×4504845663 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 31501 + ... + 43511.
It is an arithmetic number, because the mean of its divisors is an integer number (17297280).
Almost surely, 2450484566 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 450484566, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (553512960).
450484566 is an abundant number, since it is smaller than the sum of its proper divisors (656541354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450484566 is a wasteful number, since it uses less digits than its factorization.
450484566 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12089.
The product of its (nonzero) digits is 460800, while the sum is 42.
The square root of 450484566 is about 21224.6216927417. The cubic root of 450484566 is about 766.5843911288.
The spelling of 450484566 in words is "four hundred fifty million, four hundred eighty-four thousand, five hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •