Base | Representation |
---|---|
bin | 1001100100111001… |
… | …01011101101010001 |
3 | 111021022100111101221 |
4 | 10302130223231101 |
5 | 41012141102103 |
6 | 2210100525041 |
7 | 241256505205 |
oct | 46234535521 |
9 | 14238314357 |
10 | 5141347153 |
11 | 21a917a238 |
12 | bb59b0781 |
13 | 63c21b167 |
14 | 36ab76b05 |
15 | 2015771bd |
hex | 13272bb51 |
5141347153 has 2 divisors, whose sum is σ = 5141347154. Its totient is φ = 5141347152.
The previous prime is 5141347139. The next prime is 5141347271. The reversal of 5141347153 is 3517431415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3737121424 + 1404225729 = 61132^2 + 37473^2 .
It is a cyclic number.
It is not a de Polignac number, because 5141347153 - 29 = 5141346641 is a prime.
It is a super-2 number, since 2×51413471532 = 52866901095322410818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5141357153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2570673576 + 2570673577.
It is an arithmetic number, because the mean of its divisors is an integer number (2570673577).
Almost surely, 25141347153 is an apocalyptic number.
It is an amenable number.
5141347153 is a deficient number, since it is larger than the sum of its proper divisors (1).
5141347153 is an equidigital number, since it uses as much as digits as its factorization.
5141347153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25200, while the sum is 34.
The square root of 5141347153 is about 71703.1878858953. The cubic root of 5141347153 is about 1725.9397976905.
Adding to 5141347153 its reverse (3517431415), we get a palindrome (8658778568).
The spelling of 5141347153 in words is "five billion, one hundred forty-one million, three hundred forty-seven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •