Base | Representation |
---|---|
bin | 100101011100110100011… |
… | …0110110000110000001101 |
3 | 200020001122100011212101201 |
4 | 1022321220312300300031 |
5 | 1133312310240202131 |
6 | 14540320415105501 |
7 | 1040603452116415 |
oct | 112715066606015 |
9 | 20201570155351 |
10 | 5147130006541 |
11 | 1704981781096 |
12 | 6b166b512291 |
13 | 2b44abb7a933 |
14 | 13b19dcd3645 |
15 | 8dd4e38c761 |
hex | 4ae68db0c0d |
5147130006541 has 2 divisors, whose sum is σ = 5147130006542. Its totient is φ = 5147130006540.
The previous prime is 5147130006527. The next prime is 5147130006691. The reversal of 5147130006541 is 1456000317415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5085002450025 + 62127556516 = 2254995^2 + 249254^2 .
It is a cyclic number.
It is not a de Polignac number, because 5147130006541 - 221 = 5147127909389 is a prime.
It is a super-3 number, since 3×51471300065413 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5147130006541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5147130006511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2573565003270 + 2573565003271.
It is an arithmetic number, because the mean of its divisors is an integer number (2573565003271).
Almost surely, 25147130006541 is an apocalyptic number.
It is an amenable number.
5147130006541 is a deficient number, since it is larger than the sum of its proper divisors (1).
5147130006541 is an equidigital number, since it uses as much as digits as its factorization.
5147130006541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 5147130006541 in words is "five trillion, one hundred forty-seven billion, one hundred thirty million, six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •