Base | Representation |
---|---|
bin | 100101001101111010110… |
… | …1101001000100001001011 |
3 | 200010000001102210100211022 |
4 | 1022123311231020201023 |
5 | 1132301243113102111 |
6 | 14513505415223055 |
7 | 1035361525634546 |
oct | 112336555104113 |
9 | 20100042710738 |
10 | 5115133331531 |
11 | 16a2352461623 |
12 | 6a741b977a8b |
13 | 2b147cc33a42 |
14 | 13980661785d |
15 | 8d0ca30b2db |
hex | 4a6f5b4884b |
5115133331531 has 2 divisors, whose sum is σ = 5115133331532. Its totient is φ = 5115133331530.
The previous prime is 5115133331501. The next prime is 5115133331537. The reversal of 5115133331531 is 1351333315115.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5115133331531 - 226 = 5115066222667 is a prime.
It is a super-2 number, since 2×51151333315312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5115133331491 and 5115133331500.
It is not a weakly prime, because it can be changed into another prime (5115133331537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2557566665765 + 2557566665766.
It is an arithmetic number, because the mean of its divisors is an integer number (2557566665766).
Almost surely, 25115133331531 is an apocalyptic number.
5115133331531 is a deficient number, since it is larger than the sum of its proper divisors (1).
5115133331531 is an equidigital number, since it uses as much as digits as its factorization.
5115133331531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30375, while the sum is 35.
Adding to 5115133331531 its reverse (1351333315115), we get a palindrome (6466466646646).
The spelling of 5115133331531 in words is "five trillion, one hundred fifteen billion, one hundred thirty-three million, three hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •