Base | Representation |
---|---|
bin | 1011111011011011… |
… | …01111110000111101 |
3 | 121112022110120022220 |
4 | 11331231233300331 |
5 | 101103423031141 |
6 | 2535250155553 |
7 | 314462022531 |
oct | 57555576075 |
9 | 17468416286 |
10 | 6404111421 |
11 | 2796a54774 |
12 | 12a8882bb9 |
13 | 7b0a19856 |
14 | 44a763bc1 |
15 | 27735e766 |
hex | 17db6fc3d |
6404111421 has 8 divisors (see below), whose sum is σ = 8910068160. Its totient is φ = 4083781152.
The previous prime is 6404111419. The next prime is 6404111437. The reversal of 6404111421 is 1241114046.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6404111421 - 21 = 6404111419 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6404111391 and 6404111400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6404111621) 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, 46406536 + ... + 46406673.
It is an arithmetic number, because the mean of its divisors is an integer number (1113758520).
Almost surely, 26404111421 is an apocalyptic number.
It is an amenable number.
6404111421 is a deficient number, since it is larger than the sum of its proper divisors (2505956739).
6404111421 is a wasteful number, since it uses less digits than its factorization.
6404111421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92813235.
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 6404111421 is about 80025.6922556750. The cubic root of 6404111421 is about 1857.0330217947.
Adding to 6404111421 its reverse (1241114046), we get a palindrome (7645225467).
The spelling of 6404111421 in words is "six billion, four hundred four million, one hundred eleven thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •