Base | Representation |
---|---|
bin | 100111011101101000011… |
… | …0010000111101011101101 |
3 | 201012111122120101002102201 |
4 | 1032323100302013223231 |
5 | 1202330320342332044 |
6 | 15311345334221501 |
7 | 1066565422212034 |
oct | 116732062075355 |
9 | 21174576332381 |
10 | 5423751527149 |
11 | 180122238183a |
12 | 7371ab4b4891 |
13 | 3045c43a2387 |
14 | 14a72218571b |
15 | 9613e3c97d4 |
hex | 4eed0c87aed |
5423751527149 has 2 divisors, whose sum is σ = 5423751527150. Its totient is φ = 5423751527148.
The previous prime is 5423751527113. The next prime is 5423751527191. The reversal of 5423751527149 is 9417251573245.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4783362668100 + 640388859049 = 2187090^2 + 800243^2 .
It is a cyclic number.
It is not a de Polignac number, because 5423751527149 - 227 = 5423617309421 is a prime.
It is a super-2 number, since 2×54237515271492 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5423751527149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5423751327149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2711875763574 + 2711875763575.
It is an arithmetic number, because the mean of its divisors is an integer number (2711875763575).
Almost surely, 25423751527149 is an apocalyptic number.
It is an amenable number.
5423751527149 is a deficient number, since it is larger than the sum of its proper divisors (1).
5423751527149 is an equidigital number, since it uses as much as digits as its factorization.
5423751527149 is an evil number, because the sum of its binary digits is even.
The product of its digits is 10584000, while the sum is 55.
The spelling of 5423751527149 in words is "five trillion, four hundred twenty-three billion, seven hundred fifty-one million, five hundred twenty-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •