Base | Representation |
---|---|
bin | 1111000001111… |
… | …1111101001010 |
3 | 11101122001002200 |
4 | 3300133331022 |
5 | 112114423300 |
6 | 10131141030 |
7 | 1363606656 |
oct | 360377512 |
9 | 141561080 |
10 | 63045450 |
11 | 32650a86 |
12 | 19144776 |
13 | 100a5200 |
14 | 8531a66 |
15 | 5805200 |
hex | 3c1ff4a |
63045450 has 108 divisors (see below), whose sum is σ = 183635010. Its totient is φ = 15500160.
The previous prime is 63045443. The next prime is 63045457. The reversal of 63045450 is 5454036.
It is an interprime number because it is at equal distance from previous prime (63045443) and next prime (63045457).
It can be written as a sum of positive squares in 9 ways, for example, as 651249 + 62394201 = 807^2 + 7899^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (63045457) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 75636 + ... + 76464.
Almost surely, 263045450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63045450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91817505).
63045450 is an abundant number, since it is smaller than the sum of its proper divisors (120589560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63045450 is a wasteful number, since it uses less digits than its factorization.
63045450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873 (or 852 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 63045450 is about 7940.1164978859. The cubic root of 63045450 is about 398.0013846404.
Adding to 63045450 its reverse (5454036), we get a palindrome (68499486).
The spelling of 63045450 in words is "sixty-three million, forty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •