Base | Representation |
---|---|
bin | 10111001100101011100101… |
… | …01110101101100011001011 |
3 | 20200121211010012110200210112 |
4 | 23212111302232231203023 |
5 | 23141300114331004121 |
6 | 300255055243504535 |
7 | 13513404632412545 |
oct | 1346256256554313 |
9 | 220554105420715 |
10 | 51013251422411 |
11 | 15288664573853 |
12 | 587a86282814b |
13 | 22606b51b0465 |
14 | c850a9946695 |
15 | 5d6e8993d75b |
hex | 2e6572bad8cb |
51013251422411 has 4 divisors (see below), whose sum is σ = 51627868909512. Its totient is φ = 50398633935312.
The previous prime is 51013251422401. The next prime is 51013251422417. The reversal of 51013251422411 is 11422415231015.
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 51013251422411 - 214 = 51013251406027 is a prime.
It is a super-2 number, since 2×510132514224112 (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 (51013251422417) 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, 307308743426 + ... + 307308743591.
It is an arithmetic number, because the mean of its divisors is an integer number (12906967227378).
Almost surely, 251013251422411 is an apocalyptic number.
51013251422411 is a deficient number, since it is larger than the sum of its proper divisors (614617487101).
51013251422411 is an equidigital number, since it uses as much as digits as its factorization.
51013251422411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 614617487100.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 51013251422411 its reverse (11422415231015), we get a palindrome (62435666653426).
The spelling of 51013251422411 in words is "fifty-one trillion, thirteen billion, two hundred fifty-one million, four hundred twenty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •