Base | Representation |
---|---|
bin | 100111010001100110… |
… | …110110010010100000 |
3 | 11000211222210102002000 |
4 | 213101212312102200 |
5 | 1142331324441043 |
6 | 31212341524000 |
7 | 3022021241052 |
oct | 472146662240 |
9 | 130758712060 |
10 | 42171327648 |
11 | 169806846aa |
12 | 820b113600 |
13 | 3c90b85318 |
14 | 2080b038d2 |
15 | 116c43d2d3 |
hex | 9d19b64a0 |
42171327648 has 192 divisors, whose sum is σ = 131348044800. Its totient is φ = 13134320640.
The previous prime is 42171327613. The next prime is 42171327683. The reversal of 42171327648 is 84672317124.
It is an interprime number because it is at equal distance from previous prime (42171327613) and next prime (42171327683).
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, 749590 + ... + 803882.
It is an arithmetic number, because the mean of its divisors is an integer number (684104400).
Almost surely, 242171327648 is an apocalyptic number.
42171327648 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 42171327648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65674022400).
42171327648 is an abundant number, since it is smaller than the sum of its proper divisors (89176717152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42171327648 is a wasteful number, since it uses less digits than its factorization.
42171327648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54372 (or 54358 counting only the distinct ones).
The product of its digits is 451584, while the sum is 45.
The spelling of 42171327648 in words is "forty-two billion, one hundred seventy-one million, three hundred twenty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •