Base | Representation |
---|---|
bin | 111111010101110000… |
… | …0100010111111101111 |
3 | 111000002120022011211210 |
4 | 1332223200202333233 |
5 | 4212032441001223 |
6 | 142253135045503 |
7 | 12553511003502 |
oct | 1765340427757 |
9 | 430076264753 |
10 | 136021422063 |
11 | 527606016aa |
12 | 22441370893 |
13 | ca99531077 |
14 | 6825093139 |
15 | 38117cd893 |
hex | 1fab822fef |
136021422063 has 8 divisors (see below), whose sum is σ = 181364555008. Its totient is φ = 90679618584.
The previous prime is 136021422037. The next prime is 136021422073. The reversal of 136021422063 is 360224120631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 136021422063 - 29 = 136021421551 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136021422063.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136021422073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62281 + ... + 525282.
It is an arithmetic number, because the mean of its divisors is an integer number (22670569376).
Almost surely, 2136021422063 is an apocalyptic number.
136021422063 is a deficient number, since it is larger than the sum of its proper divisors (45343132945).
136021422063 is an equidigital number, since it uses as much as digits as its factorization.
136021422063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 664733.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 136021422063 its reverse (360224120631), we get a palindrome (496245542694).
It can be divided in two parts, 13602 and 1422063, that added together give a triangular number (1435665 = T1694).
The spelling of 136021422063 in words is "one hundred thirty-six billion, twenty-one million, four hundred twenty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •