Base | Representation |
---|---|
bin | 10110110101000001010000… |
… | …10010101101110101110001 |
3 | 20120202002121222220211002011 |
4 | 23122200220102231311301 |
5 | 23034440104430010031 |
6 | 254433402254122521 |
7 | 13400564041260661 |
oct | 1332405022556561 |
9 | 216662558824064 |
10 | 50200253750641 |
11 | 14aa4898584965 |
12 | 576918b4b0441 |
13 | 2201b2c498a57 |
14 | c579c32a01a1 |
15 | 5c0c555096b1 |
hex | 2da8284add71 |
50200253750641 has 2 divisors, whose sum is σ = 50200253750642. Its totient is φ = 50200253750640.
The previous prime is 50200253750617. The next prime is 50200253750719. The reversal of 50200253750641 is 14605735200205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45465621552400 + 4734632198241 = 6742820^2 + 2175921^2 .
It is a cyclic number.
It is not a de Polignac number, because 50200253750641 - 27 = 50200253750513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50200253750594 and 50200253750603.
It is not a weakly prime, because it can be changed into another prime (50200253750611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25100126875320 + 25100126875321.
It is an arithmetic number, because the mean of its divisors is an integer number (25100126875321).
Almost surely, 250200253750641 is an apocalyptic number.
It is an amenable number.
50200253750641 is a deficient number, since it is larger than the sum of its proper divisors (1).
50200253750641 is an equidigital number, since it uses as much as digits as its factorization.
50200253750641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252000, while the sum is 40.
Adding to 50200253750641 its reverse (14605735200205), we get a palindrome (64805988950846).
The spelling of 50200253750641 in words is "fifty trillion, two hundred billion, two hundred fifty-three million, seven hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •