Base | Representation |
---|---|
bin | 111111101010000001… |
… | …1000110011110001111 |
3 | 111001211222010012220210 |
4 | 1333110003012132033 |
5 | 4214431100201121 |
6 | 142444433013503 |
7 | 12606410110065 |
oct | 1772403063617 |
9 | 431758105823 |
10 | 136701568911 |
11 | 52a7a521036 |
12 | 225b10b4293 |
13 | cb7740bb1b |
14 | 688b540035 |
15 | 385137d876 |
hex | 1fd40c678f |
136701568911 has 4 divisors (see below), whose sum is σ = 182268758552. Its totient is φ = 91134379272.
The previous prime is 136701568909. The next prime is 136701568919. The reversal of 136701568911 is 119865107631.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 136701568911 - 21 = 136701568909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136701568919) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22783594816 + ... + 22783594821.
It is an arithmetic number, because the mean of its divisors is an integer number (45567189638).
Almost surely, 2136701568911 is an apocalyptic number.
136701568911 is a deficient number, since it is larger than the sum of its proper divisors (45567189641).
136701568911 is an equidigital number, since it uses as much as digits as its factorization.
136701568911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45567189640.
The product of its (nonzero) digits is 272160, while the sum is 48.
The spelling of 136701568911 in words is "one hundred thirty-six billion, seven hundred one million, five hundred sixty-eight thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •