Base | Representation |
---|---|
bin | 101110100100011000111… |
… | …0010111010001100000001 |
3 | 211122212101110200001200101 |
4 | 1131020301302322030001 |
5 | 1314330342143401121 |
6 | 21340135111522401 |
7 | 1230260211214255 |
oct | 135106162721401 |
9 | 24585343601611 |
10 | 6400336700161 |
11 | 2048405235648 |
12 | 874517989401 |
13 | 37571a6787b1 |
14 | 181ac699a265 |
15 | b174a1de491 |
hex | 5d231cba301 |
6400336700161 has 2 divisors, whose sum is σ = 6400336700162. Its totient is φ = 6400336700160.
The previous prime is 6400336700141. The next prime is 6400336700179. The reversal of 6400336700161 is 1610076330046.
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., 6139170730225 + 261165969936 = 2477735^2 + 511044^2 .
It is a cyclic number.
It is not a de Polignac number, because 6400336700161 - 215 = 6400336667393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6400336700161.
It is not a weakly prime, because it can be changed into another prime (6400336700141) 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, 3200168350080 + 3200168350081.
It is an arithmetic number, because the mean of its divisors is an integer number (3200168350081).
Almost surely, 26400336700161 is an apocalyptic number.
It is an amenable number.
6400336700161 is a deficient number, since it is larger than the sum of its proper divisors (1).
6400336700161 is an equidigital number, since it uses as much as digits as its factorization.
6400336700161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 37.
The spelling of 6400336700161 in words is "six trillion, four hundred billion, three hundred thirty-six million, seven hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •