Base | Representation |
---|---|
bin | 100111100001000110… |
… | …110000010100010000 |
3 | 11001112010001220201200 |
4 | 213201012300110100 |
5 | 1143344411200112 |
6 | 31254231031200 |
7 | 3031326344601 |
oct | 474106602420 |
9 | 131463056650 |
10 | 42431350032 |
11 | 16aa4433335 |
12 | 828220b500 |
13 | 40029c6816 |
14 | 20a746bda8 |
15 | 11851a1cdc |
hex | 9e11b0510 |
42431350032 has 60 divisors (see below), whose sum is σ = 119505273420. Its totient is φ = 14053688064.
The previous prime is 42431350019. The next prime is 42431350033. The reversal of 42431350032 is 23005313424.
It can be written as a sum of positive squares in 2 ways, for example, as 26999747856 + 15431602176 = 164316^2 + 124224^2 .
It is a junction number, because it is equal to n+sod(n) for n = 42431349978 and 42431350005.
It is not an unprimeable number, because it can be changed into a prime (42431350033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 915807 + ... + 961022.
It is an arithmetic number, because the mean of its divisors is an integer number (1991754557).
Almost surely, 242431350032 is an apocalyptic number.
It is an amenable number.
42431350032 is an abundant number, since it is smaller than the sum of its proper divisors (77073923388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42431350032 is a wasteful number, since it uses less digits than its factorization.
42431350032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1877000 (or 1876991 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 42431350032 its reverse (23005313424), we get a palindrome (65436663456).
The spelling of 42431350032 in words is "forty-two billion, four hundred thirty-one million, three hundred fifty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •