Base | Representation |
---|---|
bin | 100101001011100110011… |
… | …0000100100101110110011 |
3 | 200002112012020102001001102 |
4 | 1022113030300210232303 |
5 | 1132211042224302441 |
6 | 14511323211155015 |
7 | 1035124213134113 |
oct | 112271460445663 |
9 | 20075166361042 |
10 | 5110151400371 |
11 | 16a0226275a46 |
12 | 6a646b445a6b |
13 | 2b0b67a60594 |
14 | 139492adb043 |
15 | 8cdd7c7369b |
hex | 4a5ccc24bb3 |
5110151400371 has 2 divisors, whose sum is σ = 5110151400372. Its totient is φ = 5110151400370.
The previous prime is 5110151400331. The next prime is 5110151400377. The reversal of 5110151400371 is 1730041510115.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5110151400371 - 230 = 5109077658547 is a prime.
It is a super-2 number, since 2×51101514003712 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5110151400377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555075700185 + 2555075700186.
It is an arithmetic number, because the mean of its divisors is an integer number (2555075700186).
Almost surely, 25110151400371 is an apocalyptic number.
5110151400371 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110151400371 is an equidigital number, since it uses as much as digits as its factorization.
5110151400371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2100, while the sum is 29.
Adding to 5110151400371 its reverse (1730041510115), we get a palindrome (6840192910486).
The spelling of 5110151400371 in words is "five trillion, one hundred ten billion, one hundred fifty-one million, four hundred thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •