Base | Representation |
---|---|
bin | 101001000010011100100… |
… | …1100110010101100000111 |
3 | 201222012110211200010112011 |
4 | 1102010321030302230013 |
5 | 1214402213414324221 |
6 | 15555032412435051 |
7 | 1121331460353004 |
oct | 122047114625407 |
9 | 21865424603464 |
10 | 5640251714311 |
11 | 1885021062855 |
12 | 771150a78a87 |
13 | 31bb47c96ab6 |
14 | 156dbd7dc8ab |
15 | 9bab11e81e1 |
hex | 52139332b07 |
5640251714311 has 2 divisors, whose sum is σ = 5640251714312. Its totient is φ = 5640251714310.
The previous prime is 5640251714291. The next prime is 5640251714333. The reversal of 5640251714311 is 1134171520465.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5640251714311 - 29 = 5640251713799 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5640251714341) 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, 2820125857155 + 2820125857156.
It is an arithmetic number, because the mean of its divisors is an integer number (2820125857156).
Almost surely, 25640251714311 is an apocalyptic number.
5640251714311 is a deficient number, since it is larger than the sum of its proper divisors (1).
5640251714311 is an equidigital number, since it uses as much as digits as its factorization.
5640251714311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 5640251714311 in words is "five trillion, six hundred forty billion, two hundred fifty-one million, seven hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •