Base | Representation |
---|---|
bin | 1011111101110100… |
… | …11011101110011111 |
3 | 121120201021220110211 |
4 | 11332322123232133 |
5 | 101124044330211 |
6 | 2541245113251 |
7 | 315124631065 |
oct | 57672335637 |
9 | 17521256424 |
10 | 6424214431 |
11 | 27a7335428 |
12 | 12b3558827 |
13 | 7b4c37b1b |
14 | 44d2b8035 |
15 | 278ed0e21 |
hex | 17ee9bb9f |
6424214431 has 8 divisors (see below), whose sum is σ = 6765390720. Its totient is φ = 6083344152.
The previous prime is 6424214389. The next prime is 6424214449. The reversal of 6424214431 is 1344124246.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6424214431 - 29 = 6424213919 is a prime.
It is a super-2 number, since 2×64242144312 = 82541062110937307522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6424214393 and 6424214402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6424214231) 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, 32755 + ... + 117988.
It is an arithmetic number, because the mean of its divisors is an integer number (845673840).
Almost surely, 26424214431 is an apocalyptic number.
6424214431 is a deficient number, since it is larger than the sum of its proper divisors (341176289).
6424214431 is a wasteful number, since it uses less digits than its factorization.
6424214431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153005.
The product of its digits is 18432, while the sum is 31.
The square root of 6424214431 is about 80151.1973148249. The cubic root of 6424214431 is about 1858.9741164181.
Adding to 6424214431 its reverse (1344124246), we get a palindrome (7768338677).
The spelling of 6424214431 in words is "six billion, four hundred twenty-four million, two hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •