Base | Representation |
---|---|
bin | 1101000110000001101… |
… | …00010011111000000000 |
3 | 1121000022002221011101220 |
4 | 12203000310103320000 |
5 | 24332404323142102 |
6 | 542404141355040 |
7 | 44335140652410 |
oct | 6430064237000 |
9 | 1530262834356 |
10 | 449911537152 |
11 | 163896373a60 |
12 | 73242568a80 |
13 | 33570c7698c |
14 | 17ac0c66640 |
15 | ba836171bc |
hex | 68c0d13e00 |
449911537152 has 640 divisors, whose sum is σ = 1551617261568. Its totient is φ = 112427827200.
The previous prime is 449911537111. The next prime is 449911537177. The reversal of 449911537152 is 251735119944.
It is a super-2 number, since 2×4499115371522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 449911537095 and 449911537104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1015601443 + ... + 1015601885.
Almost surely, 2449911537152 is an apocalyptic number.
449911537152 is a gapful number since it is divisible by the number (42) 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 449911537152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (775808630784).
449911537152 is an abundant number, since it is smaller than the sum of its proper divisors (1101705724416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
449911537152 is a wasteful number, since it uses less digits than its factorization.
449911537152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 790 (or 774 counting only the distinct ones).
The product of its digits is 1360800, while the sum is 51.
The spelling of 449911537152 in words is "four hundred forty-nine billion, nine hundred eleven million, five hundred thirty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •