Base | Representation |
---|---|
bin | 10111010010000111110101… |
… | …11011110001011100001001 |
3 | 20201021200201101002201020120 |
4 | 23221003322323301130021 |
5 | 23202331022324010241 |
6 | 300521020104213453 |
7 | 13533044120326446 |
oct | 1351037273613411 |
9 | 221250641081216 |
10 | 51200220141321 |
11 | 1534a989534659 |
12 | 58aab4216a289 |
13 | 22752107c7804 |
14 | c901650789cd |
15 | 5dbc7dd32666 |
hex | 2e90faef1709 |
51200220141321 has 8 divisors (see below), whose sum is σ = 68278913802624. Its totient is φ = 34127503287120.
The previous prime is 51200220141271. The next prime is 51200220141337. The reversal of 51200220141321 is 12314102200215.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51200220141321 - 27 = 51200220141193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51200220141291 and 51200220141300.
It is not an unprimeable number, because it can be changed into a prime (51200220131321) 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, 1494181786 + ... + 1494216051.
It is an arithmetic number, because the mean of its divisors is an integer number (8534864225328).
Almost surely, 251200220141321 is an apocalyptic number.
It is an amenable number.
51200220141321 is a deficient number, since it is larger than the sum of its proper divisors (17078693661303).
51200220141321 is a wasteful number, since it uses less digits than its factorization.
51200220141321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988403551.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 51200220141321 its reverse (12314102200215), we get a palindrome (63514322341536).
The spelling of 51200220141321 in words is "fifty-one trillion, two hundred billion, two hundred twenty million, one hundred forty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •