Base | Representation |
---|---|
bin | 1110001101100111001011… |
… | …01111110001100101101001 |
3 | 11002122212010112201010111212 |
4 | 13012303211233301211221 |
5 | 13044031231324131131 |
6 | 150245523422402505 |
7 | 6404013106246262 |
oct | 706634557614551 |
9 | 132585115633455 |
10 | 31254036552041 |
11 | 9a5a84292a516 |
12 | 36092a9730435 |
13 | 1459320b456b4 |
14 | 7a09bc351969 |
15 | 392ec88eea2b |
hex | 1c6ce5bf1969 |
31254036552041 has 2 divisors, whose sum is σ = 31254036552042. Its totient is φ = 31254036552040.
The previous prime is 31254036551993. The next prime is 31254036552061. The reversal of 31254036552041 is 14025563045213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16749333834025 + 14504702718016 = 4092595^2 + 3808504^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31254036552041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31254036552041.
It is not a weakly prime, because it can be changed into another prime (31254036552061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15627018276020 + 15627018276021.
It is an arithmetic number, because the mean of its divisors is an integer number (15627018276021).
Almost surely, 231254036552041 is an apocalyptic number.
It is an amenable number.
31254036552041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31254036552041 is an equidigital number, since it uses as much as digits as its factorization.
31254036552041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 31254036552041 its reverse (14025563045213), we get a palindrome (45279599597254).
The spelling of 31254036552041 in words is "thirty-one trillion, two hundred fifty-four billion, thirty-six million, five hundred fifty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •