Base | Representation |
---|---|
bin | 101110100111110111… |
… | …111101100101011101 |
3 | 11210012211210122121120 |
4 | 232213313331211131 |
5 | 1310011120334001 |
6 | 34555303121153 |
7 | 3421363242621 |
oct | 564767754535 |
9 | 153184718546 |
10 | 50061105501 |
11 | 1a25a209570 |
12 | 98514431b9 |
13 | 494a615c24 |
14 | 25cc8b9181 |
15 | 147ee15236 |
hex | ba7dfd95d |
50061105501 has 32 divisors (see below), whose sum is σ = 75219025920. Its totient is φ = 29340273600.
The previous prime is 50061105499. The next prime is 50061105511. The reversal of 50061105501 is 10550116005.
It is not a de Polignac number, because 50061105501 - 21 = 50061105499 is a prime.
It is a super-2 number, since 2×500611055012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50061105511) 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, 1469580 + ... + 1503258.
It is an arithmetic number, because the mean of its divisors is an integer number (2350594560).
Almost surely, 250061105501 is an apocalyptic number.
It is an amenable number.
50061105501 is a deficient number, since it is larger than the sum of its proper divisors (25157920419).
50061105501 is a wasteful number, since it uses less digits than its factorization.
50061105501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35177.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 50061105501 in words is "fifty billion, sixty-one million, one hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •