Base | Representation |
---|---|
bin | 10111011011010000011111… |
… | …10101001100011101011011 |
3 | 20202101200220102201212112121 |
4 | 23231220033311030131123 |
5 | 23223001340424214011 |
6 | 301321130302522111 |
7 | 13564525334515351 |
oct | 1355501765143533 |
9 | 222350812655477 |
10 | 51514103351131 |
11 | 1546101040a973 |
12 | 593b940b96337 |
13 | 22989b3993365 |
14 | ca141dd717d1 |
15 | 5e5000254e71 |
hex | 2eda0fd4c75b |
51514103351131 has 4 divisors (see below), whose sum is σ = 51537941439064. Its totient is φ = 51490265263200.
The previous prime is 51514103351107. The next prime is 51514103351141. The reversal of 51514103351131 is 13115330141515.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51514103351131 - 231 = 51511955867483 is a prime.
It is a super-2 number, since 2×515141033511312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51514103351101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11919040725 + ... + 11919045046.
It is an arithmetic number, because the mean of its divisors is an integer number (12884485359766).
Almost surely, 251514103351131 is an apocalyptic number.
51514103351131 is a deficient number, since it is larger than the sum of its proper divisors (23838087933).
51514103351131 is a wasteful number, since it uses less digits than its factorization.
51514103351131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23838087932.
The product of its (nonzero) digits is 13500, while the sum is 34.
Adding to 51514103351131 its reverse (13115330141515), we get a palindrome (64629433492646).
The spelling of 51514103351131 in words is "fifty-one trillion, five hundred fourteen billion, one hundred three million, three hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •