Base | Representation |
---|---|
bin | 10110110000111110110011… |
… | …11101101100110100001101 |
3 | 20120020211111001111202102000 |
4 | 23120133121331230310031 |
5 | 23030201423132240401 |
6 | 254245534054022513 |
7 | 13354552440433542 |
oct | 1330373175546415 |
9 | 216224431452360 |
10 | 50061500665101 |
11 | 14a50a66030042 |
12 | 5746307347a39 |
13 | 21c1a19046083 |
14 | c50dbd4d4bc9 |
15 | 5bc333ede186 |
hex | 2d87d9f6cd0d |
50061500665101 has 64 divisors (see below), whose sum is σ = 78462613785600. Its totient is φ = 31458313051200.
The previous prime is 50061500665087. The next prime is 50061500665103. The reversal of 50061500665101 is 10156600516005.
It is not a de Polignac number, because 50061500665101 - 25 = 50061500665069 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50061500665103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 362220231 + ... + 362358411.
It is an arithmetic number, because the mean of its divisors is an integer number (1225978340400).
Almost surely, 250061500665101 is an apocalyptic number.
It is an amenable number.
50061500665101 is a deficient number, since it is larger than the sum of its proper divisors (28401113120499).
50061500665101 is a wasteful number, since it uses less digits than its factorization.
50061500665101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141767 (or 141761 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 50061500665101 in words is "fifty trillion, sixty-one billion, five hundred million, six hundred sixty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •