Base | Representation |
---|---|
bin | 100111100000111000… |
… | …000111011101000111 |
3 | 11001111211211221211022 |
4 | 213200320013131013 |
5 | 1143342420401042 |
6 | 31254012501355 |
7 | 3031251623102 |
oct | 474070073507 |
9 | 131454757738 |
10 | 42427512647 |
11 | 16aa2252243 |
12 | 8280a7a85b |
13 | 4001c81c90 |
14 | 20a6b4d739 |
15 | 1184b94cd2 |
hex | 9e0e07747 |
42427512647 has 8 divisors (see below), whose sum is σ = 46926064416. Its totient is φ = 38105374752.
The previous prime is 42427512637. The next prime is 42427512653. The reversal of 42427512647 is 74621572424.
42427512647 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42427512647 - 26 = 42427512583 is a prime.
It is a super-2 number, since 2×424275126472 (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 = 42427512598 and 42427512607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42427512637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44102963 + ... + 44103924.
It is an arithmetic number, because the mean of its divisors is an integer number (5865758052).
Almost surely, 242427512647 is an apocalyptic number.
42427512647 is a deficient number, since it is larger than the sum of its proper divisors (4498551769).
42427512647 is a wasteful number, since it uses less digits than its factorization.
42427512647 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88206937.
The product of its digits is 752640, while the sum is 44.
The spelling of 42427512647 in words is "forty-two billion, four hundred twenty-seven million, five hundred twelve thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.322 sec. • engine limits •