Base | Representation |
---|---|
bin | 101110101001110001010… |
… | …1110001110000000001001 |
3 | 211200222012222121010111022 |
4 | 1131103202232032000021 |
5 | 1320023030103104200 |
6 | 21345330041442225 |
7 | 1231146510004115 |
oct | 135234256160011 |
9 | 24628188533438 |
10 | 6411894972425 |
11 | 20522a6610678 |
12 | 8768027a0375 |
13 | 37684014b957 |
14 | 1824a1a70745 |
15 | b1bc4ca7885 |
hex | 5d4e2b8e009 |
6411894972425 has 12 divisors (see below), whose sum is σ = 8032716261276. Its totient is φ = 5076634368000.
The previous prime is 6411894972401. The next prime is 6411894972437. The reversal of 6411894972425 is 5242794981146.
It can be written as a sum of positive squares in 6 ways, for example, as 1328276995081 + 5083617977344 = 1152509^2 + 2254688^2 .
It is not a de Polignac number, because 6411894972425 - 26 = 6411894972361 is a prime.
It is a super-2 number, since 2×64118949724252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1322037776 + ... + 1322042625.
It is an arithmetic number, because the mean of its divisors is an integer number (669393021773).
Almost surely, 26411894972425 is an apocalyptic number.
It is an amenable number.
6411894972425 is a deficient number, since it is larger than the sum of its proper divisors (1620821288851).
6411894972425 is a wasteful number, since it uses less digits than its factorization.
6411894972425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2644080508 (or 2644080503 counting only the distinct ones).
The product of its digits is 34836480, while the sum is 62.
The spelling of 6411894972425 in words is "six trillion, four hundred eleven billion, eight hundred ninety-four million, nine hundred seventy-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •