Base | Representation |
---|---|
bin | 1011111010110101… |
… | …00100101100001001 |
3 | 121111222000012211001 |
4 | 11331122210230021 |
5 | 101101131212241 |
6 | 2534550335001 |
7 | 314401220266 |
oct | 57532445411 |
9 | 17458005731 |
10 | 6399085321 |
11 | 2794131572 |
12 | 12a705a461 |
13 | 7ac979c25 |
14 | 449c1626d |
15 | 276bba431 |
hex | 17d6a4b09 |
6399085321 has 2 divisors, whose sum is σ = 6399085322. Its totient is φ = 6399085320.
The previous prime is 6399085309. The next prime is 6399085333. The reversal of 6399085321 is 1235809936.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (6399085309) and next prime (6399085333).
It can be written as a sum of positive squares in only one way, i.e., 3199599225 + 3199486096 = 56565^2 + 56564^2 .
It is a cyclic number.
It is not a de Polignac number, because 6399085321 - 25 = 6399085289 is a prime.
It is not a weakly prime, because it can be changed into another prime (6399085351) 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 as a sum of consecutive naturals, namely, 3199542660 + 3199542661.
It is an arithmetic number, because the mean of its divisors is an integer number (3199542661).
Almost surely, 26399085321 is an apocalyptic number.
6399085321 is the 56565-th centered square number.
It is an amenable number.
6399085321 is a deficient number, since it is larger than the sum of its proper divisors (1).
6399085321 is an equidigital number, since it uses as much as digits as its factorization.
6399085321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 46.
The square root of 6399085321 is about 79994.2830519782. The cubic root of 6399085321 is about 1856.5470799846.
The spelling of 6399085321 in words is "six billion, three hundred ninety-nine million, eighty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •