Base | Representation |
---|---|
bin | 111111101001110001… |
… | …1001101111111111011 |
3 | 111001211101101121012101 |
4 | 1333103203031333323 |
5 | 4214421430224011 |
6 | 142443533524231 |
7 | 12606246060301 |
oct | 1772343157773 |
9 | 431741347171 |
10 | 136693211131 |
11 | 52a75832784 |
12 | 225aa343677 |
13 | cb757738a9 |
14 | 688a3a6271 |
15 | 385077c2c1 |
hex | 1fd38cdffb |
136693211131 has 4 divisors (see below), whose sum is σ = 136694776072. Its totient is φ = 136691646192.
The previous prime is 136693211129. The next prime is 136693211267. The reversal of 136693211131 is 131112396631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136693211131 - 21 = 136693211129 is a prime.
It is a super-2 number, since 2×1366932111312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136693211111) 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, 643185 + ... + 828898.
It is an arithmetic number, because the mean of its divisors is an integer number (34173694018).
Almost surely, 2136693211131 is an apocalyptic number.
136693211131 is a deficient number, since it is larger than the sum of its proper divisors (1564941).
136693211131 is an equidigital number, since it uses as much as digits as its factorization.
136693211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1564940.
The product of its digits is 17496, while the sum is 37.
The spelling of 136693211131 in words is "one hundred thirty-six billion, six hundred ninety-three million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •