Base | Representation |
---|---|
bin | 100111100011100010… |
… | …001010010100100111 |
3 | 11001121221201122220120 |
4 | 213203202022110213 |
5 | 1143440323320441 |
6 | 31302244133023 |
7 | 3032332540662 |
oct | 474342122447 |
9 | 131557648816 |
10 | 42472088871 |
11 | 17015428aa3 |
12 | 8293997173 |
13 | 400b28b744 |
14 | 20aca346d9 |
15 | 1188a4c966 |
hex | 9e388a527 |
42472088871 has 8 divisors (see below), whose sum is σ = 57946416000. Its totient is φ = 27656243832.
The previous prime is 42472088849. The next prime is 42472088891. The reversal of 42472088871 is 17888027424.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42472088871 - 26 = 42472088807 is a prime.
It is a super-2 number, since 2×424720888712 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42472088801) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 164620371 + ... + 164620628.
It is an arithmetic number, because the mean of its divisors is an integer number (7243302000).
Almost surely, 242472088871 is an apocalyptic number.
42472088871 is a deficient number, since it is larger than the sum of its proper divisors (15474327129).
42472088871 is a wasteful number, since it uses less digits than its factorization.
42472088871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329241045.
The product of its (nonzero) digits is 1605632, while the sum is 51.
It can be divided in two parts, 424720 and 88871, that added together give a triangular number (513591 = T1013).
The spelling of 42472088871 in words is "forty-two billion, four hundred seventy-two million, eighty-eight thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •