Base | Representation |
---|---|
bin | 1010001001011… |
… | …0111110101010 |
3 | 2222002100100000 |
4 | 2202112332222 |
5 | 41343431300 |
6 | 4120123430 |
7 | 1024523601 |
oct | 242267652 |
9 | 88070300 |
10 | 42561450 |
11 | 22030058 |
12 | 12306576 |
13 | 8a826b9 |
14 | 591ca38 |
15 | 3b0ac00 |
hex | 2896faa |
42561450 has 144 divisors (see below), whose sum is σ = 123492096. Its totient is φ = 10886400.
The previous prime is 42561413. The next prime is 42561503. The reversal of 42561450 is 5416524.
42561450 is a `hidden beast` number, since 42 + 5 + 614 + 5 + 0 = 666.
It is a super-2 number, since 2×425614502 = 3622954052205000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 376594 + ... + 376706.
It is an arithmetic number, because the mean of its divisors is an integer number (857584).
Almost surely, 242561450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42561450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61746048).
42561450 is an abundant number, since it is smaller than the sum of its proper divisors (80930646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42561450 is a wasteful number, since it uses less digits than its factorization.
42561450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171 (or 154 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 42561450 is about 6523.9137026788. The cubic root of 42561450 is about 349.1447143850.
Adding to 42561450 its reverse (5416524), we get a palindrome (47977974).
The spelling of 42561450 in words is "forty-two million, five hundred sixty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •