Base | Representation |
---|---|
bin | 10110110011000011010100… |
… | …10100010111100000101111 |
3 | 20120111122010000111011112022 |
4 | 23121201222110113200233 |
5 | 23032333122323043431 |
6 | 254342341235500355 |
7 | 13362651414016112 |
oct | 1331415224274057 |
9 | 216448100434468 |
10 | 50132642002991 |
11 | 14a79152501169 |
12 | 57580604576bb |
13 | 21c8645a85b92 |
14 | c5460b92a579 |
15 | 5be0e98ee07b |
hex | 2d986a51782f |
50132642002991 has 2 divisors, whose sum is σ = 50132642002992. Its totient is φ = 50132642002990.
The previous prime is 50132642002939. The next prime is 50132642003011. The reversal of 50132642002991 is 19920024623105.
It is a happy number.
50132642002991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50132642002991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50132642002921) 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, 25066321001495 + 25066321001496.
It is an arithmetic number, because the mean of its divisors is an integer number (25066321001496).
Almost surely, 250132642002991 is an apocalyptic number.
50132642002991 is a deficient number, since it is larger than the sum of its proper divisors (1).
50132642002991 is an equidigital number, since it uses as much as digits as its factorization.
50132642002991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 44.
The spelling of 50132642002991 in words is "fifty trillion, one hundred thirty-two billion, six hundred forty-two million, two thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •