Base | Representation |
---|---|
bin | 10011011000000011101000… |
… | …00110101010011101000000 |
3 | 12120212021202102012221100110 |
4 | 21230001310012222131000 |
5 | 21041042213002331003 |
6 | 230341504502351320 |
7 | 11655220353622131 |
oct | 1154016406523500 |
9 | 176767672187313 |
10 | 42608023480128 |
11 | 12637a63513867 |
12 | 4941878a2b540 |
13 | 1aa0bc4b308c2 |
14 | a7434ca69c88 |
15 | 4dd4ec14ea03 |
hex | 26c0741aa740 |
42608023480128 has 224 divisors, whose sum is σ = 114294493117440. Its totient is φ = 14007574425600.
The previous prime is 42608023480117. The next prime is 42608023480213. The reversal of 42608023480128 is 82108432080624.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5184084403 + ... + 5184092621.
Almost surely, 242608023480128 is an apocalyptic number.
42608023480128 is a gapful number since it is divisible by the number (48) 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 42608023480128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57147246558720).
42608023480128 is an abundant number, since it is smaller than the sum of its proper divisors (71686469637312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42608023480128 is a wasteful number, since it uses less digits than its factorization.
42608023480128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9645 (or 9635 counting only the distinct ones).
The product of its (nonzero) digits is 1179648, while the sum is 48.
The spelling of 42608023480128 in words is "forty-two trillion, six hundred eight billion, twenty-three million, four hundred eighty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •