Base | Representation |
---|---|
bin | 11010110111001… |
… | …111101111010000 |
3 | 1011102001102110020 |
4 | 122313033233100 |
5 | 1410334040000 |
6 | 112415503440 |
7 | 14111542005 |
oct | 3267175720 |
9 | 1142042406 |
10 | 450690000 |
11 | 211448082 |
12 | 106b27b80 |
13 | 724aba97 |
14 | 43bdb8ac |
15 | 29877ba0 |
hex | 1adcfbd0 |
450690000 has 200 divisors, whose sum is σ = 1480551072. Its totient is φ = 118080000.
The previous prime is 450689971. The next prime is 450690011. The reversal of 450690000 is 96054.
It is a tau number, because it is divible by the number of its divisors (200).
It is a super-2 number, since 2×4506900002 = 406242952200000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2489910 + ... + 2490090.
Almost surely, 2450690000 is an apocalyptic number.
450690000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 450690000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (740275536).
450690000 is an abundant number, since it is smaller than the sum of its proper divisors (1029861072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450690000 is a wasteful number, since it uses less digits than its factorization.
450690000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295 (or 274 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 450690000 is about 21229.4606620140. The cubic root of 450690000 is about 766.7009016428.
The spelling of 450690000 in words is "four hundred fifty million, six hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •