Base | Representation |
---|---|
bin | 10111001100010101100001… |
… | …11111001010110111000001 |
3 | 20200120200120000200001022002 |
4 | 23212022300333022313001 |
5 | 23141101342210203043 |
6 | 300245420314553345 |
7 | 13512505336600535 |
oct | 1346126077126701 |
9 | 220520500601262 |
10 | 51001411022273 |
11 | 15283638a10998 |
12 | 58784b9438855 |
13 | 225c54912922a |
14 | c846a51d1bc5 |
15 | 5d69e51e6bb8 |
hex | 2e62b0fcadc1 |
51001411022273 has 2 divisors, whose sum is σ = 51001411022274. Its totient is φ = 51001411022272.
The previous prime is 51001411022251. The next prime is 51001411022299. The reversal of 51001411022273 is 37222011410015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36479039084944 + 14522371937329 = 6039788^2 + 3810823^2 .
It is a cyclic number.
It is not a de Polignac number, because 51001411022273 - 236 = 50932691545537 is a prime.
It is a super-2 number, since 2×510014110222732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51001411028273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25500705511136 + 25500705511137.
It is an arithmetic number, because the mean of its divisors is an integer number (25500705511137).
Almost surely, 251001411022273 is an apocalyptic number.
It is an amenable number.
51001411022273 is a deficient number, since it is larger than the sum of its proper divisors (1).
51001411022273 is an equidigital number, since it uses as much as digits as its factorization.
51001411022273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3360, while the sum is 29.
Adding to 51001411022273 its reverse (37222011410015), we get a palindrome (88223422432288).
The spelling of 51001411022273 in words is "fifty-one trillion, one billion, four hundred eleven million, twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •