Base | Representation |
---|---|
bin | 100110110111010000000… |
… | …1010110000111010111111 |
3 | 200220121220120121012000001 |
4 | 1031232200022300322333 |
5 | 1200003021332302221 |
6 | 15205435051415131 |
7 | 1060620113566345 |
oct | 115564012607277 |
9 | 20817816535001 |
10 | 5341331525311 |
11 | 177a278441541 |
12 | 7232291544a7 |
13 | 2c98baa9a712 |
14 | 146743c61995 |
15 | 93e18733391 |
hex | 4dba02b0ebf |
5341331525311 has 2 divisors, whose sum is σ = 5341331525312. Its totient is φ = 5341331525310.
The previous prime is 5341331525303. The next prime is 5341331525323. The reversal of 5341331525311 is 1135251331435.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5341331525311 - 23 = 5341331525303 is a prime.
It is a super-2 number, since 2×53413315253112 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5341331525381) 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, 2670665762655 + 2670665762656.
It is an arithmetic number, because the mean of its divisors is an integer number (2670665762656).
Almost surely, 25341331525311 is an apocalyptic number.
5341331525311 is a deficient number, since it is larger than the sum of its proper divisors (1).
5341331525311 is an equidigital number, since it uses as much as digits as its factorization.
5341331525311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 81000, while the sum is 37.
Adding to 5341331525311 its reverse (1135251331435), we get a palindrome (6476582856746).
The spelling of 5341331525311 in words is "five trillion, three hundred forty-one billion, three hundred thirty-one million, five hundred twenty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •