Base | Representation |
---|---|
bin | 10111000110111001101100… |
… | …01100110110111111111001 |
3 | 20122220211112112122010022222 |
4 | 23203130312030312333321 |
5 | 23130021414324412031 |
6 | 300023534055253425 |
7 | 13463144554266416 |
oct | 1343346614667771 |
9 | 218824475563288 |
10 | 50814667419641 |
11 | 1521141a0282a4 |
12 | 584828137a275 |
13 | 2247a58351288 |
14 | c7962b93d10d |
15 | 5d1c1596de7b |
hex | 2e3736336ff9 |
50814667419641 has 2 divisors, whose sum is σ = 50814667419642. Its totient is φ = 50814667419640.
The previous prime is 50814667419629. The next prime is 50814667419647. The reversal of 50814667419641 is 14691476641805.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37583079294016 + 13231588125625 = 6130504^2 + 3637525^2 .
It is a cyclic number.
It is not a de Polignac number, because 50814667419641 - 226 = 50814600310777 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (50814667419647) 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, 25407333709820 + 25407333709821.
It is an arithmetic number, because the mean of its divisors is an integer number (25407333709821).
Almost surely, 250814667419641 is an apocalyptic number.
It is an amenable number.
50814667419641 is a deficient number, since it is larger than the sum of its proper divisors (1).
50814667419641 is an equidigital number, since it uses as much as digits as its factorization.
50814667419641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34836480, while the sum is 62.
The spelling of 50814667419641 in words is "fifty trillion, eight hundred fourteen billion, six hundred sixty-seven million, four hundred nineteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •