Base | Representation |
---|---|
bin | 10110101111011101001101… |
… | …01110100001111111010101 |
3 | 20120001211020021010110211102 |
4 | 23113232212232201333111 |
5 | 23023322114432134104 |
6 | 254205510344515445 |
7 | 13351016103414341 |
oct | 1327564656417725 |
9 | 216054207113742 |
10 | 50009101443029 |
11 | 14a30817036a33 |
12 | 5738122a7bb85 |
13 | 21b9ab8200821 |
14 | c4c64c2a8621 |
15 | 5bacb8bc8a1e |
hex | 2d7ba6ba1fd5 |
50009101443029 has 2 divisors, whose sum is σ = 50009101443030. Its totient is φ = 50009101443028.
The previous prime is 50009101443019. The next prime is 50009101443089. The reversal of 50009101443029 is 92034410190005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50008559018929 + 542424100 = 7071673^2 + 23290^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50009101443029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50009101442983 and 50009101443001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50009101443019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25004550721514 + 25004550721515.
It is an arithmetic number, because the mean of its divisors is an integer number (25004550721515).
Almost surely, 250009101443029 is an apocalyptic number.
It is an amenable number.
50009101443029 is a deficient number, since it is larger than the sum of its proper divisors (1).
50009101443029 is an equidigital number, since it uses as much as digits as its factorization.
50009101443029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 38.
The spelling of 50009101443029 in words is "fifty trillion, nine billion, one hundred one million, four hundred forty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •