Base | Representation |
---|---|
bin | 101110101111111010… |
… | …100101011011101111 |
3 | 11210120020122112210201 |
4 | 232233322211123233 |
5 | 1310300134320420 |
6 | 35020522414331 |
7 | 3424622023423 |
oct | 565772453357 |
9 | 153506575721 |
10 | 50196010735 |
11 | 1a3193808a2 |
12 | 988a6613a7 |
13 | 496c55b300 |
14 | 2602794b83 |
15 | 148bbb210a |
hex | bafea56ef |
50196010735 has 12 divisors (see below), whose sum is σ = 65225113272. Its totient is φ = 37067822688.
The previous prime is 50196010693. The next prime is 50196010751. The reversal of 50196010735 is 53701069105.
It is not a de Polignac number, because 50196010735 - 213 = 50196002543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50196010694 and 50196010703.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29700937 + ... + 29702626.
It is an arithmetic number, because the mean of its divisors is an integer number (5435426106).
Almost surely, 250196010735 is an apocalyptic number.
50196010735 is a deficient number, since it is larger than the sum of its proper divisors (15029102537).
50196010735 is a wasteful number, since it uses less digits than its factorization.
50196010735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59403594 (or 59403581 counting only the distinct ones).
The product of its (nonzero) digits is 28350, while the sum is 37.
The spelling of 50196010735 in words is "fifty billion, one hundred ninety-six million, ten thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •