Base | Representation |
---|---|
bin | 10110101111100001011100… |
… | …10110011000100000011011 |
3 | 20120002001002211122022011022 |
4 | 23113300232112120200123 |
5 | 23023341244431022412 |
6 | 254210524225553055 |
7 | 13351126352640302 |
oct | 1327605626304033 |
9 | 216061084568138 |
10 | 50011376814107 |
11 | 14a317844659a5 |
12 | 5738658aa578b |
13 | 21ba08b731647 |
14 | c4c7c6565439 |
15 | 5bad9d832a72 |
hex | 2d7c2e59881b |
50011376814107 has 2 divisors, whose sum is σ = 50011376814108. Its totient is φ = 50011376814106.
The previous prime is 50011376814103. The next prime is 50011376814149. The reversal of 50011376814107 is 70141867311005.
50011376814107 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50011376814107 - 22 = 50011376814103 is a prime.
It is a super-2 number, since 2×500113768141072 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50011376814103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25005688407053 + 25005688407054.
It is an arithmetic number, because the mean of its divisors is an integer number (25005688407054).
Almost surely, 250011376814107 is an apocalyptic number.
50011376814107 is a deficient number, since it is larger than the sum of its proper divisors (1).
50011376814107 is an equidigital number, since it uses as much as digits as its factorization.
50011376814107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 44.
The spelling of 50011376814107 in words is "fifty trillion, eleven billion, three hundred seventy-six million, eight hundred fourteen thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •