Base | Representation |
---|---|
bin | 100111001111110111… |
… | …010111100011111000 |
3 | 11000202221210200111021 |
4 | 213033313113203320 |
5 | 1142301334310200 |
6 | 31205415312224 |
7 | 3021214654246 |
oct | 471767274370 |
9 | 130687720437 |
10 | 42142103800 |
11 | 16966134365 |
12 | 820137b674 |
13 | 3c87ac26c4 |
14 | 207ac97796 |
15 | 1169ab941a |
hex | 9cfdd78f8 |
42142103800 has 48 divisors (see below), whose sum is σ = 98004664800. Its totient is φ = 16852665600.
The previous prime is 42142103791. The next prime is 42142103807. The reversal of 42142103800 is 830124124.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42142103807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 857905 + ... + 905695.
It is an arithmetic number, because the mean of its divisors is an integer number (2041763850).
Almost surely, 242142103800 is an apocalyptic number.
42142103800 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42142103800 is an abundant number, since it is smaller than the sum of its proper divisors (55862561000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42142103800 is a wasteful number, since it uses less digits than its factorization.
42142103800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52216 (or 52207 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 42142103800 its reverse (830124124), we get a palindrome (42972227924).
The spelling of 42142103800 in words is "forty-two billion, one hundred forty-two million, one hundred three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •