Base | Representation |
---|---|
bin | 1011111011100010… |
… | …01100001111011001 |
3 | 121112101011110002212 |
4 | 11331301030033121 |
5 | 101104140430424 |
6 | 2535321404505 |
7 | 314502503426 |
oct | 57561141731 |
9 | 17471143085 |
10 | 6405014489 |
11 | 2797511205 |
12 | 12a9039735 |
13 | 7b0c74903 |
14 | 44a91ad4d |
15 | 27748c10e |
hex | 17dc4c3d9 |
6405014489 has 2 divisors, whose sum is σ = 6405014490. Its totient is φ = 6405014488.
The previous prime is 6405014471. The next prime is 6405014491. The reversal of 6405014489 is 9844105046.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5559193600 + 845820889 = 74560^2 + 29083^2 .
It is a cyclic number.
It is not a de Polignac number, because 6405014489 - 232 = 2110047193 is a prime.
It is a super-2 number, since 2×64050144892 = 82048421208599862242, which contains 22 as substring.
Together with 6405014491, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (6405014419) by changing a digit.
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 as a sum of consecutive naturals, namely, 3202507244 + 3202507245.
It is an arithmetic number, because the mean of its divisors is an integer number (3202507245).
Almost surely, 26405014489 is an apocalyptic number.
It is an amenable number.
6405014489 is a deficient number, since it is larger than the sum of its proper divisors (1).
6405014489 is an equidigital number, since it uses as much as digits as its factorization.
6405014489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 41.
The square root of 6405014489 is about 80031.3344197134. The cubic root of 6405014489 is about 1857.1203067780.
The spelling of 6405014489 in words is "six billion, four hundred five million, fourteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •