Base | Representation |
---|---|
bin | 100111111010101101… |
… | …100000001001110000 |
3 | 11002122001102020102020 |
4 | 213322231200021300 |
5 | 1200234400002330 |
6 | 31405014351440 |
7 | 3045063650310 |
oct | 477255401160 |
9 | 132561366366 |
10 | 42860937840 |
11 | 171a4977a86 |
12 | 838205b580 |
13 | 40709c75a6 |
14 | 2108535440 |
15 | 11acc5c210 |
hex | 9fab60270 |
42860937840 has 160 divisors (see below), whose sum is σ = 152143643136. Its totient is φ = 9777853440.
The previous prime is 42860937839. The next prime is 42860937887. The reversal of 42860937840 is 4873906824.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 854250 + ... + 903030.
Almost surely, 242860937840 is an apocalyptic number.
42860937840 is a gapful number since it is divisible by the number (40) 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 42860937840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76071821568).
42860937840 is an abundant number, since it is smaller than the sum of its proper divisors (109282705296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42860937840 is a wasteful number, since it uses less digits than its factorization.
42860937840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49327 (or 49321 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 51.
It can be divided in two parts, 42860 and 937840, that added together give a triangular number (980700 = T1400).
The spelling of 42860937840 in words is "forty-two billion, eight hundred sixty million, nine hundred thirty-seven thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •