Base | Representation |
---|---|
bin | 10011001110000000110010… |
… | …10101100000001000000000 |
3 | 12112122021221101122020001022 |
4 | 21213000121111200020000 |
5 | 21014413411213302043 |
6 | 225515150522325012 |
7 | 11621252066301251 |
oct | 1147003125401000 |
9 | 175567841566038 |
10 | 42262903259648 |
11 | 1251466210a055 |
12 | 48a6a00959768 |
13 | 1a774b421a7a6 |
14 | a6176d322b28 |
15 | 4d454d706868 |
hex | 267019560200 |
42262903259648 has 160 divisors (see below), whose sum is σ = 90190487439360. Its totient is φ = 19748382474240.
The previous prime is 42262903259609. The next prime is 42262903259653. The reversal of 42262903259648 is 84695230926224.
It is a super-3 number, since 3×422629032596483 (a number of 42 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77040215 + ... + 77586857.
It is an arithmetic number, because the mean of its divisors is an integer number (563690546496).
Almost surely, 242262903259648 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 42262903259648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45095243719680).
42262903259648 is an abundant number, since it is smaller than the sum of its proper divisors (47927584179712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42262903259648 is a wasteful number, since it uses less digits than its factorization.
42262903259648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 546858 (or 546842 counting only the distinct ones).
The product of its (nonzero) digits is 89579520, while the sum is 62.
The spelling of 42262903259648 in words is "forty-two trillion, two hundred sixty-two billion, nine hundred three million, two hundred fifty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •