Base | Representation |
---|---|
bin | 101011100111101100110… |
… | …1100111010001100100001 |
3 | 210020010111001011200212011 |
4 | 1113033121230322030201 |
5 | 1241211012220301442 |
6 | 20430043040432521 |
7 | 1156063645360201 |
oct | 127173154721441 |
9 | 23203431150764 |
10 | 5995131806497 |
11 | 1a01580680639 |
12 | 809a91618741 |
13 | 346452900022 |
14 | 16a24743c401 |
15 | a5e318ba117 |
hex | 573d9b3a321 |
5995131806497 has 2 divisors, whose sum is σ = 5995131806498. Its totient is φ = 5995131806496.
The previous prime is 5995131806401. The next prime is 5995131806509. The reversal of 5995131806497 is 7946081315995.
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., 5895553061776 + 99578744721 = 2428076^2 + 315561^2 .
It is a cyclic number.
It is not a de Polignac number, because 5995131806497 - 231 = 5992984322849 is a prime.
It is a super-2 number, since 2×59951318064972 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5995131801497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2997565903248 + 2997565903249.
It is an arithmetic number, because the mean of its divisors is an integer number (2997565903249).
Almost surely, 25995131806497 is an apocalyptic number.
It is an amenable number.
5995131806497 is a deficient number, since it is larger than the sum of its proper divisors (1).
5995131806497 is an equidigital number, since it uses as much as digits as its factorization.
5995131806497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73483200, while the sum is 67.
The spelling of 5995131806497 in words is "five trillion, nine hundred ninety-five billion, one hundred thirty-one million, eight hundred six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.080 sec. • engine limits •