Base | Representation |
---|---|
bin | 1011111011001110… |
… | …01110010000001001 |
3 | 121112012020200110200 |
4 | 11331213032100021 |
5 | 101103003320124 |
6 | 2535145402413 |
7 | 314441340654 |
oct | 57547162011 |
9 | 17465220420 |
10 | 6402401289 |
11 | 2795a96939 |
12 | 12a8199409 |
13 | 7b056b33b |
14 | 44a43a89b |
15 | 277122bc9 |
hex | 17d9ce409 |
6402401289 has 24 divisors (see below), whose sum is σ = 9571189992. Its totient is φ = 4121210880.
The previous prime is 6402401249. The next prime is 6402401293. The reversal of 6402401289 is 9821042046.
6402401289 is a `hidden beast` number, since 640 + 2 + 4 + 0 + 1 + 2 + 8 + 9 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 266342400 + 6136058889 = 16320^2 + 78333^2 .
It is not a de Polignac number, because 6402401289 - 29 = 6402400777 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6402401249) 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 23 ways as a sum of consecutive naturals, for example, 53644 + ... + 125229.
It is an arithmetic number, because the mean of its divisors is an integer number (398799583).
Almost surely, 26402401289 is an apocalyptic number.
It is an amenable number.
6402401289 is a deficient number, since it is larger than the sum of its proper divisors (3168788703).
6402401289 is a wasteful number, since it uses less digits than its factorization.
6402401289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179017 (or 179014 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 6402401289 is about 80015.0066487531. The cubic root of 6402401289 is about 1856.8677084977.
The spelling of 6402401289 in words is "six billion, four hundred two million, four hundred one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •