Base | Representation |
---|---|
bin | 111111101010010100… |
… | …0011010011100100010 |
3 | 111001212122112011010012 |
4 | 1333110220122130202 |
5 | 4214441101200200 |
6 | 142445422404522 |
7 | 12606556205402 |
oct | 1772450323442 |
9 | 431778464105 |
10 | 136711350050 |
11 | 52a84aa1820 |
12 | 225b4430742 |
13 | cb79454b92 |
14 | 688c968802 |
15 | 3852161a35 |
hex | 1fd4a1a722 |
136711350050 has 96 divisors (see below), whose sum is σ = 286686079488. Its totient is φ = 48052800000.
The previous prime is 136711350001. The next prime is 136711350059. The reversal of 136711350050 is 50053117631.
It is a junction number, because it is equal to n+sod(n) for n = 136711349989 and 136711350016.
It is not an unprimeable number, because it can be changed into a prime (136711350059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16039790 + ... + 16048310.
It is an arithmetic number, because the mean of its divisors is an integer number (2986313328).
Almost surely, 2136711350050 is an apocalyptic number.
136711350050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136711350050 is an abundant number, since it is smaller than the sum of its proper divisors (149974729438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136711350050 is a wasteful number, since it uses less digits than its factorization.
136711350050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9516 (or 9511 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 32.
Adding to 136711350050 its reverse (50053117631), we get a palindrome (186764467681).
The spelling of 136711350050 in words is "one hundred thirty-six billion, seven hundred eleven million, three hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •