Base | Representation |
---|---|
bin | 100111011111011111… |
… | …010000110010001000 |
3 | 11001110020000120101011 |
4 | 213133133100302020 |
5 | 1143320440020130 |
6 | 31251421333304 |
7 | 3030546631450 |
oct | 473737206210 |
9 | 131406016334 |
10 | 42404220040 |
11 | 16a90093156 |
12 | 8275107234 |
13 | 3cca1b7c80 |
14 | 20a3a08d60 |
15 | 1182ae352a |
hex | 9df7d0c88 |
42404220040 has 64 divisors (see below), whose sum is σ = 117427080960. Its totient is φ = 13420235520.
The previous prime is 42404220031. The next prime is 42404220097. The reversal of 42404220040 is 4002240424.
It is a super-3 number, since 3×424042200403 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42404219993 and 42404220020.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5821116 + ... + 5828395.
It is an arithmetic number, because the mean of its divisors is an integer number (1834798140).
Almost surely, 242404220040 is an apocalyptic number.
42404220040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42404220040 is an abundant number, since it is smaller than the sum of its proper divisors (75022860920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42404220040 is a wasteful number, since it uses less digits than its factorization.
42404220040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11649542 (or 11649538 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 22.
Adding to 42404220040 its reverse (4002240424), we get a palindrome (46406460464).
The spelling of 42404220040 in words is "forty-two billion, four hundred four million, two hundred twenty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •