Base | Representation |
---|---|
bin | 10110110011000011010100… |
… | …10100010111100001000011 |
3 | 20120111122010000111011120001 |
4 | 23121201222110113201003 |
5 | 23032333122323044021 |
6 | 254342341235500431 |
7 | 13362651414016141 |
oct | 1331415224274103 |
9 | 216448100434501 |
10 | 50132642003011 |
11 | 14a79152501187 |
12 | 5758060457717 |
13 | 21c8645a85ba9 |
14 | c5460b92a591 |
15 | 5be0e98ee091 |
hex | 2d986a517843 |
50132642003011 has 2 divisors, whose sum is σ = 50132642003012. Its totient is φ = 50132642003010.
The previous prime is 50132642002991. The next prime is 50132642003057. The reversal of 50132642003011 is 11030024623105.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50132642003011 - 235 = 50098282264643 is a prime.
It is a super-2 number, since 2×501326420030112 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50132642003071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25066321001505 + 25066321001506.
It is an arithmetic number, because the mean of its divisors is an integer number (25066321001506).
Almost surely, 250132642003011 is an apocalyptic number.
50132642003011 is a deficient number, since it is larger than the sum of its proper divisors (1).
50132642003011 is an equidigital number, since it uses as much as digits as its factorization.
50132642003011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 50132642003011 its reverse (11030024623105), we get a palindrome (61162666626116).
The spelling of 50132642003011 in words is "fifty trillion, one hundred thirty-two billion, six hundred forty-two million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •