Base | Representation |
---|---|
bin | 100111010000110111… |
… | …110010011011010000 |
3 | 11000211010120122110012 |
4 | 213100313302123100 |
5 | 1142320200203211 |
6 | 31211221254052 |
7 | 3021511340240 |
oct | 472067623320 |
9 | 130733518405 |
10 | 42158991056 |
11 | 16974718a76 |
12 | 8206b64328 |
13 | 3c8b456070 |
14 | 207d211b20 |
15 | 116b302d8b |
hex | 9d0df26d0 |
42158991056 has 80 divisors (see below), whose sum is σ = 100582562304. Its totient is φ = 16670057472.
The previous prime is 42158991031. The next prime is 42158991059. The reversal of 42158991056 is 65019985124.
42158991056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 42158990995 and 42158991013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42158991059) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3556916 + ... + 3568748.
Almost surely, 242158991056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42158991056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50291281152).
42158991056 is an abundant number, since it is smaller than the sum of its proper divisors (58423571248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42158991056 is a wasteful number, since it uses less digits than its factorization.
42158991056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14308 (or 14302 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 50.
The spelling of 42158991056 in words is "forty-two billion, one hundred fifty-eight million, nine hundred ninety-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •