Base | Representation |
---|---|
bin | 10110110010110001111101… |
… | …10100101000111111001001 |
3 | 20120110202001111212210002121 |
4 | 23121120332310220333021 |
5 | 23032210031004043311 |
6 | 254334200354531241 |
7 | 13362201440064016 |
oct | 1331307664507711 |
9 | 216422044783077 |
10 | 50123322331081 |
11 | 14a751aa81a77a |
12 | 575629b296b21 |
13 | 21c77bc00ab0c |
14 | c53da5ca070d |
15 | 5bdc51629b71 |
hex | 2d963ed28fc9 |
50123322331081 has 2 divisors, whose sum is σ = 50123322331082. Its totient is φ = 50123322331080.
The previous prime is 50123322331073. The next prime is 50123322331091. The reversal of 50123322331081 is 18013322332105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29434097102400 + 20689225228681 = 5425320^2 + 4548541^2 .
It is a cyclic number.
It is not a de Polignac number, because 50123322331081 - 23 = 50123322331073 is a prime.
It is a super-2 number, since 2×501233223310812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50123322331031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25061661165540 + 25061661165541.
It is an arithmetic number, because the mean of its divisors is an integer number (25061661165541).
Almost surely, 250123322331081 is an apocalyptic number.
It is an amenable number.
50123322331081 is a deficient number, since it is larger than the sum of its proper divisors (1).
50123322331081 is an equidigital number, since it uses as much as digits as its factorization.
50123322331081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 50123322331081 its reverse (18013322332105), we get a palindrome (68136644663186).
The spelling of 50123322331081 in words is "fifty trillion, one hundred twenty-three billion, three hundred twenty-two million, three hundred thirty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •