Base | Representation |
---|---|
bin | 100111101000110011… |
… | …110100010100001000 |
3 | 11001212010021200000110 |
4 | 213220303310110020 |
5 | 1144131003302100 |
6 | 31315125234320 |
7 | 3034456105560 |
oct | 475063642410 |
9 | 131763250013 |
10 | 42560603400 |
11 | 170603952a7 |
12 | 82b95629a0 |
13 | 40237104c3 |
14 | 20ba6b5da0 |
15 | 11916d4250 |
hex | 9e8cf4508 |
42560603400 has 192 divisors, whose sum is σ = 150881950080. Its totient is φ = 9721958400.
The previous prime is 42560603399. The next prime is 42560603473. The reversal of 42560603400 is 430606524.
It is a super-2 number, since 2×425606034002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11510352 + ... + 11514048.
It is an arithmetic number, because the mean of its divisors is an integer number (785843490).
Almost surely, 242560603400 is an apocalyptic number.
42560603400 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 42560603400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75440975040).
42560603400 is an abundant number, since it is smaller than the sum of its proper divisors (108321346680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42560603400 is a wasteful number, since it uses less digits than its factorization.
42560603400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6464 (or 6455 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The spelling of 42560603400 in words is "forty-two billion, five hundred sixty million, six hundred three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •