Base | Representation |
---|---|
bin | 10011011111000111101010… |
… | …10111100100111001010000 |
3 | 12121201111011200100221122020 |
4 | 21233203311113210321100 |
5 | 21104031223321440443 |
6 | 231045202232211440 |
7 | 12011601356130123 |
oct | 1157436527447120 |
9 | 177644150327566 |
10 | 42850710343248 |
11 | 1272097a967035 |
12 | 4980908239b80 |
13 | 1abaa5ca69462 |
14 | a81db20cc3ba |
15 | 4e49a2de8583 |
hex | 26f8f55e4e50 |
42850710343248 has 80 divisors (see below), whose sum is σ = 112359350761536. Its totient is φ = 14069195458560.
The previous prime is 42850710343169. The next prime is 42850710343249. The reversal of 42850710343248 is 84234301705824.
It is a super-2 number, since 2×428507103432482 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42850710343248.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42850710343249) 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, 37974840 + ... + 39086952.
Almost surely, 242850710343248 is an apocalyptic number.
42850710343248 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
42850710343248 is an abundant number, since it is smaller than the sum of its proper divisors (69508640418288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42850710343248 is a wasteful number, since it uses less digits than its factorization.
42850710343248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1124172 (or 1124166 counting only the distinct ones).
The product of its (nonzero) digits is 5160960, while the sum is 51.
The spelling of 42850710343248 in words is "forty-two trillion, eight hundred fifty billion, seven hundred ten million, three hundred forty-three thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •