Base | Representation |
---|---|
bin | 111111100111111001… |
… | …1110001100011110111 |
3 | 111001200000021121110022 |
4 | 1333033303301203313 |
5 | 4214304343122411 |
6 | 142433412315355 |
7 | 12604554411503 |
oct | 1771763614367 |
9 | 431600247408 |
10 | 136630442231 |
11 | 52a43360558 |
12 | 22591312b5b |
13 | cb6576752a |
14 | 6881d07303 |
15 | 3849ecdedb |
hex | 1fcfcf18f7 |
136630442231 has 4 divisors (see below), whose sum is σ = 136688070264. Its totient is φ = 136572814200.
The previous prime is 136630442227. The next prime is 136630442237. The reversal of 136630442231 is 132244036631.
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 136630442231 - 22 = 136630442227 is a prime.
It is a super-2 number, since 2×1366304422312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136630442191 and 136630442200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136630442237) 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, 28810460 + ... + 28815201.
It is an arithmetic number, because the mean of its divisors is an integer number (34172017566).
Almost surely, 2136630442231 is an apocalyptic number.
136630442231 is a deficient number, since it is larger than the sum of its proper divisors (57628033).
136630442231 is an equidigital number, since it uses as much as digits as its factorization.
136630442231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57628032.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 136630442231 its reverse (132244036631), we get a palindrome (268874478862).
The spelling of 136630442231 in words is "one hundred thirty-six billion, six hundred thirty million, four hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •