Base | Representation |
---|---|
bin | 100111100001001011… |
… | …111101001011111111 |
3 | 11001112012122012000102 |
4 | 213201023331023333 |
5 | 1143400233312341 |
6 | 31254320151315 |
7 | 3031344053621 |
oct | 474113751377 |
9 | 131465565012 |
10 | 42432713471 |
11 | 16aa5184745 |
12 | 828276853b |
13 | 40030832a5 |
14 | 20a7704c11 |
15 | 1185370c9b |
hex | 9e12fd2ff |
42432713471 has 8 divisors (see below), whose sum is σ = 45755430000. Its totient is φ = 39218938560.
The previous prime is 42432713459. The next prime is 42432713497. The reversal of 42432713471 is 17431723424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42432713471 is a prime.
It is a super-3 number, since 3×424327134713 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42432713971) 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 7 ways as a sum of consecutive naturals, for example, 27234596 + ... + 27236153.
It is an arithmetic number, because the mean of its divisors is an integer number (5719428750).
Almost surely, 242432713471 is an apocalyptic number.
42432713471 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
42432713471 is a deficient number, since it is larger than the sum of its proper divisors (3322716529).
42432713471 is a wasteful number, since it uses less digits than its factorization.
42432713471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54470809.
The product of its digits is 112896, while the sum is 38.
The spelling of 42432713471 in words is "forty-two billion, four hundred thirty-two million, seven hundred thirteen thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •