Base | Representation |
---|---|
bin | 10011001001101000110001… |
… | …10000000000001110110000 |
3 | 12112002220220101021201221220 |
4 | 21210310120300000032300 |
5 | 21004433020302334240 |
6 | 225322125233545040 |
7 | 11604350506122420 |
oct | 1144643060001660 |
9 | 175086811251856 |
10 | 42112569574320 |
11 | 1246692771a203 |
12 | 4881846415180 |
13 | 1a662767a7cbb |
14 | a5838b510480 |
15 | 4d06a06b25d0 |
hex | 264d18c003b0 |
42112569574320 has 640 divisors, whose sum is σ = 164886479732736. Its totient is φ = 8663370743808.
The previous prime is 42112569574261. The next prime is 42112569574433. The reversal of 42112569574320 is 2347596521124.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3985285677 + ... + 3985296243.
Almost surely, 242112569574320 is an apocalyptic number.
42112569574320 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 42112569574320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82443239866368).
42112569574320 is an abundant number, since it is smaller than the sum of its proper divisors (122773910158416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42112569574320 is a wasteful number, since it uses less digits than its factorization.
42112569574320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16697 (or 16691 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 42112569574320 in words is "forty-two trillion, one hundred twelve billion, five hundred sixty-nine million, five hundred seventy-four thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •