Base | Representation |
---|---|
bin | 11010110110101… |
… | …001111110100100 |
3 | 1011101202120021210 |
4 | 122312221332210 |
5 | 1410314112312 |
6 | 112412311420 |
7 | 14110326042 |
oct | 3266517644 |
9 | 1141676253 |
10 | 450535332 |
11 | 211351955 |
12 | 106a72570 |
13 | 72456570 |
14 | 43b9b392 |
15 | 29846e3c |
hex | 1ada9fa4 |
450535332 has 48 divisors (see below), whose sum is σ = 1136398592. Its totient is φ = 138101760.
The previous prime is 450535321. The next prime is 450535367. The reversal of 450535332 is 233535054.
It is a super-3 number, since 3×4505353323 (a number of 27 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 450535332.
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 15 ways as a sum of consecutive naturals, for example, 36948 + ... + 47604.
Almost surely, 2450535332 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 450535332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (568199296).
450535332 is an abundant number, since it is smaller than the sum of its proper divisors (685863260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450535332 is a wasteful number, since it uses less digits than its factorization.
450535332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10948 (or 10946 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 30.
The square root of 450535332 is about 21225.8175814266. The cubic root of 450535332 is about 766.6131860195.
The spelling of 450535332 in words is "four hundred fifty million, five hundred thirty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •