Base | Representation |
---|---|
bin | 10111010000110011110011… |
… | …10111100101110111001101 |
3 | 20201010101021020012201221012 |
4 | 23220121321313211313031 |
5 | 23201111123402032001 |
6 | 300444155244415005 |
7 | 13526556123030326 |
oct | 1350317167456715 |
9 | 221111236181835 |
10 | 51155105111501 |
11 | 15332838251a46 |
12 | 58a2251247465 |
13 | 2270ba0b0cab1 |
14 | c8bcc542544d |
15 | 5da9dd2712bb |
hex | 2e8679de5dcd |
51155105111501 has 16 divisors (see below), whose sum is σ = 51334861909680. Its totient is φ = 50975757381120.
The previous prime is 51155105111489. The next prime is 51155105111519. The reversal of 51155105111501 is 10511150155115.
It can be written as a sum of positive squares in 8 ways, for example, as 28452729492100 + 22702375619401 = 5334110^2 + 4764701^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51155105111501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51155105111521) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 699367391 + ... + 699440531.
It is an arithmetic number, because the mean of its divisors is an integer number (3208428869355).
Almost surely, 251155105111501 is an apocalyptic number.
It is an amenable number.
51155105111501 is a deficient number, since it is larger than the sum of its proper divisors (179756798179).
51155105111501 is a wasteful number, since it uses less digits than its factorization.
51155105111501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75904.
The product of its (nonzero) digits is 3125, while the sum is 32.
Adding to 51155105111501 its reverse (10511150155115), we get a palindrome (61666255266616).
The spelling of 51155105111501 in words is "fifty-one trillion, one hundred fifty-five billion, one hundred five million, one hundred eleven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •