Base | Representation |
---|---|
bin | 10110110000111101111001… |
… | …10001110001111011010001 |
3 | 20120020210012221010020121002 |
4 | 23120132330301301323101 |
5 | 23030144422304013131 |
6 | 254245413322511345 |
7 | 13354534343365535 |
oct | 1330367461617321 |
9 | 216223187106532 |
10 | 50061011001041 |
11 | 14a508346931a7 |
12 | 57461ab365555 |
13 | 21c196b76c721 |
14 | c50d7446dbc5 |
15 | 5bc3060186cb |
hex | 2d87bcc71ed1 |
50061011001041 has 2 divisors, whose sum is σ = 50061011001042. Its totient is φ = 50061011001040.
The previous prime is 50061011000989. The next prime is 50061011001103. The reversal of 50061011001041 is 14010011016005.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49666621977025 + 394389024016 = 7047455^2 + 628004^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50061011001041 is a prime.
It is a super-3 number, since 3×500610110010413 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (50061011001341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25030505500520 + 25030505500521.
It is an arithmetic number, because the mean of its divisors is an integer number (25030505500521).
Almost surely, 250061011001041 is an apocalyptic number.
It is an amenable number.
50061011001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
50061011001041 is an equidigital number, since it uses as much as digits as its factorization.
50061011001041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 50061011001041 its reverse (14010011016005), we get a palindrome (64071022017046).
The spelling of 50061011001041 in words is "fifty trillion, sixty-one billion, eleven million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •