Base | Representation |
---|---|
bin | 1100010111000001010… |
… | …00010110000110110101 |
3 | 1111121011100211000011222 |
4 | 12023200220112012311 |
5 | 23424213404431301 |
6 | 523032045040125 |
7 | 42452565626042 |
oct | 6134050260665 |
9 | 1447140730158 |
10 | 424675467701 |
11 | 154116259511 |
12 | 6a37ab56045 |
13 | 3107b8676c4 |
14 | 167a93cc1c9 |
15 | b0a7d6331b |
hex | 62e0a161b5 |
424675467701 has 4 divisors (see below), whose sum is σ = 428880175404. Its totient is φ = 420470760000.
The previous prime is 424675467661. The next prime is 424675467707. The reversal of 424675467701 is 107764576424.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 254292267076 + 170383200625 = 504274^2 + 412775^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424675467701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424675467707) 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 3 ways as a sum of consecutive naturals, for example, 2102353700 + ... + 2102353901.
It is an arithmetic number, because the mean of its divisors is an integer number (107220043851).
Almost surely, 2424675467701 is an apocalyptic number.
It is an amenable number.
424675467701 is a deficient number, since it is larger than the sum of its proper divisors (4204707703).
424675467701 is a wasteful number, since it uses less digits than its factorization.
424675467701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4204707702.
The product of its (nonzero) digits is 7902720, while the sum is 53.
The spelling of 424675467701 in words is "four hundred twenty-four billion, six hundred seventy-five million, four hundred sixty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •