Base | Representation |
---|---|
bin | 10110111000110101000010… |
… | …10001111100101010000001 |
3 | 20121012121110011120210202002 |
4 | 23130122201101330222001 |
5 | 23044111124422024301 |
6 | 255013445250233345 |
7 | 13413206246241011 |
oct | 1334324121745201 |
9 | 217177404523662 |
10 | 50331132611201 |
11 | 1504534a257a32 |
12 | 578a616585855 |
13 | 2211289475000 |
14 | c6007b381c41 |
15 | 5c43655c116b |
hex | 2dc6a147ca81 |
50331132611201 has 32 divisors (see below), whose sum is σ = 54715920473760. Its totient is φ = 46295688112128.
The previous prime is 50331132611159. The next prime is 50331132611209. The reversal of 50331132611201 is 10211623113305.
It can be written as a sum of positive squares in 16 ways, for example, as 50058101280625 + 273031330576 = 7075175^2 + 522524^2 .
It is not a de Polignac number, because 50331132611201 - 222 = 50331128416897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50331132611209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1389692045 + ... + 1389728261.
It is an arithmetic number, because the mean of its divisors is an integer number (1709872514805).
Almost surely, 250331132611201 is an apocalyptic number.
It is an amenable number.
50331132611201 is a deficient number, since it is larger than the sum of its proper divisors (4384787862559).
50331132611201 is a wasteful number, since it uses less digits than its factorization.
50331132611201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38470 (or 38444 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 50331132611201 its reverse (10211623113305), we get a palindrome (60542755724506).
The spelling of 50331132611201 in words is "fifty trillion, three hundred thirty-one billion, one hundred thirty-two million, six hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •