Base | Representation |
---|---|
bin | 10111010111000001001010… |
… | …10101010011110111110011 |
3 | 20201212202220120102021002022 |
4 | 23223200211111103313303 |
5 | 23213110023403003241 |
6 | 301130200000542055 |
7 | 13551150465632453 |
oct | 1353404525236763 |
9 | 221782816367068 |
10 | 51368435203571 |
11 | 1540525a555662 |
12 | 591766902192b |
13 | 228803aa065c5 |
14 | c98361a39d63 |
15 | 5e1326aec54b |
hex | 2eb825553df3 |
51368435203571 has 8 divisors (see below), whose sum is σ = 52757394919440. Its totient is φ = 49979508310368.
The previous prime is 51368435203511. The next prime is 51368435203597. The reversal of 51368435203571 is 17530253486315.
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 51368435203571 - 26 = 51368435203507 is a prime.
It is a super-2 number, since 2×513684352035712 (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 (51368435203511) 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, 5016761 + ... + 11309498.
It is an arithmetic number, because the mean of its divisors is an integer number (6594674364930).
Almost surely, 251368435203571 is an apocalyptic number.
51368435203571 is a deficient number, since it is larger than the sum of its proper divisors (1388959715869).
51368435203571 is a wasteful number, since it uses less digits than its factorization.
51368435203571 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16411333.
The product of its (nonzero) digits is 9072000, while the sum is 53.
Adding to 51368435203571 its reverse (17530253486315), we get a palindrome (68898688689886).
The spelling of 51368435203571 in words is "fifty-one trillion, three hundred sixty-eight billion, four hundred thirty-five million, two hundred three thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •