Base | Representation |
---|---|
bin | 101110101010001110… |
… | …011100111011101001 |
3 | 11210022121000220211112 |
4 | 232222032130323221 |
5 | 1310101220233442 |
6 | 35003232440105 |
7 | 3422352460316 |
oct | 565216347351 |
9 | 153277026745 |
10 | 50100555497 |
11 | 1a27a503973 |
12 | 98626a9035 |
13 | 4955849315 |
14 | 25d3c27d0d |
15 | 1483609082 |
hex | baa39cee9 |
50100555497 has 2 divisors, whose sum is σ = 50100555498. Its totient is φ = 50100555496.
The previous prime is 50100555493. The next prime is 50100555509. The reversal of 50100555497 is 79455500105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50077935961 + 22619536 = 223781^2 + 4756^2 .
It is a cyclic number.
It is not a de Polignac number, because 50100555497 - 22 = 50100555493 is a prime.
It is a super-2 number, since 2×501005554972 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50100555493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25050277748 + 25050277749.
It is an arithmetic number, because the mean of its divisors is an integer number (25050277749).
Almost surely, 250100555497 is an apocalyptic number.
It is an amenable number.
50100555497 is a deficient number, since it is larger than the sum of its proper divisors (1).
50100555497 is an equidigital number, since it uses as much as digits as its factorization.
50100555497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 41.
The spelling of 50100555497 in words is "fifty billion, one hundred million, five hundred fifty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •