Base | Representation |
---|---|
bin | 1011111011001011… |
… | …01100010100100001 |
3 | 121112011111022020002 |
4 | 11331211230110201 |
5 | 101102403001121 |
6 | 2535133025345 |
7 | 314435050334 |
oct | 57545542441 |
9 | 17464438202 |
10 | 6402000161 |
11 | 2795842527 |
12 | 12a8025255 |
13 | 7b045a89b |
14 | 44a37461b |
15 | 277093e0b |
hex | 17d96c521 |
6402000161 has 2 divisors, whose sum is σ = 6402000162. Its totient is φ = 6402000160.
The previous prime is 6402000151. The next prime is 6402000167. The reversal of 6402000161 is 1610002046.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3933798400 + 2468201761 = 62720^2 + 49681^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6402000161 is a prime.
It is a super-2 number, since 2×64020001612 = 81971212122888051842, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (6402000167) 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, 3201000080 + 3201000081.
It is an arithmetic number, because the mean of its divisors is an integer number (3201000081).
Almost surely, 26402000161 is an apocalyptic number.
It is an amenable number.
6402000161 is a deficient number, since it is larger than the sum of its proper divisors (1).
6402000161 is an equidigital number, since it uses as much as digits as its factorization.
6402000161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 6402000161 is about 80012.5000296829. The cubic root of 6402000161 is about 1856.8289284030.
The spelling of 6402000161 in words is "six billion, four hundred two million, one hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •