Base | Representation |
---|---|
bin | 10111001111010010110000… |
… | …11110101000011000100111 |
3 | 20200221101210022020201122212 |
4 | 23213221120132220120213 |
5 | 23144232423330000201 |
6 | 300404221353114035 |
7 | 13523033053035623 |
oct | 1347513036503047 |
9 | 220841708221585 |
10 | 51103005312551 |
11 | 15312732278965 |
12 | 58941310b891b |
13 | 2268cba0228aa |
14 | c89581c9c183 |
15 | 5d948e3a3abb |
hex | 2e7a587a8627 |
51103005312551 has 8 divisors (see below), whose sum is σ = 51751218100800. Its totient is φ = 50454826007040.
The previous prime is 51103005312547. The next prime is 51103005312563. The reversal of 51103005312551 is 15521350030115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51103005312551 - 22 = 51103005312547 is a prime.
It is a super-2 number, since 2×511030053125512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51103005312851) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5291690 + ... + 11410871.
It is an arithmetic number, because the mean of its divisors is an integer number (6468902262600).
Almost surely, 251103005312551 is an apocalyptic number.
51103005312551 is a deficient number, since it is larger than the sum of its proper divisors (648212788249).
51103005312551 is a wasteful number, since it uses less digits than its factorization.
51103005312551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16741369.
The product of its (nonzero) digits is 11250, while the sum is 32.
Adding to 51103005312551 its reverse (15521350030115), we get a palindrome (66624355342666).
The spelling of 51103005312551 in words is "fifty-one trillion, one hundred three billion, five million, three hundred twelve thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •