Base | Representation |
---|---|
bin | 111111010101101110… |
… | …1100100010111001111 |
3 | 111000002111211111202002 |
4 | 1332223131210113033 |
5 | 4212032241004411 |
6 | 142253110222515 |
7 | 12553501242146 |
oct | 1765335442717 |
9 | 430074744662 |
10 | 136020641231 |
11 | 52760118a92 |
12 | 22441054a3b |
13 | ca99319837 |
14 | 6824d2c75d |
15 | 38116c733b |
hex | 1fab7645cf |
136020641231 has 12 divisors (see below), whose sum is σ = 140921180400. Its totient is φ = 131285121408.
The previous prime is 136020641177. The next prime is 136020641249. The reversal of 136020641231 is 132146020631.
It is not a de Polignac number, because 136020641231 - 226 = 135953532367 is a prime.
It is a super-2 number, since 2×1360206412312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136020641194 and 136020641203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136020641131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2563175 + ... + 2615703.
It is an arithmetic number, because the mean of its divisors is an integer number (11743431700).
Almost surely, 2136020641231 is an apocalyptic number.
136020641231 is a deficient number, since it is larger than the sum of its proper divisors (4900539169).
136020641231 is an equidigital number, since it uses as much as digits as its factorization.
136020641231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55666 (or 55637 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 136020641231 its reverse (132146020631), we get a palindrome (268166661862).
The spelling of 136020641231 in words is "one hundred thirty-six billion, twenty million, six hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •