Base | Representation |
---|---|
bin | 100111100001001010… |
… | …011110011111111111 |
3 | 11001112011220110222222 |
4 | 213201022132133333 |
5 | 1143400133410011 |
6 | 31254303555555 |
7 | 3031340550113 |
oct | 474112363777 |
9 | 131464813888 |
10 | 42432325631 |
11 | 16aa4a3a313 |
12 | 82825bbbbb |
13 | 4002c788b7 |
14 | 20a7643743 |
15 | 11852e5ddb |
hex | 9e129e7ff |
42432325631 has 4 divisors (see below), whose sum is σ = 43065643992. Its totient is φ = 41799007272.
The previous prime is 42432325609. The next prime is 42432325651. The reversal of 42432325631 is 13652323424.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 42432325631 - 226 = 42365216767 is a prime.
It is a super-2 number, since 2×424323256312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42432325591 and 42432325600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42432325651) 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 3 ways as a sum of consecutive naturals, for example, 316659080 + ... + 316659213.
It is an arithmetic number, because the mean of its divisors is an integer number (10766410998).
Almost surely, 242432325631 is an apocalyptic number.
42432325631 is a deficient number, since it is larger than the sum of its proper divisors (633318361).
42432325631 is an equidigital number, since it uses as much as digits as its factorization.
42432325631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633318360.
The product of its digits is 103680, while the sum is 35.
The spelling of 42432325631 in words is "forty-two billion, four hundred thirty-two million, three hundred twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •