Base | Representation |
---|---|
bin | 111111011100000000… |
… | …1101001000011111101 |
3 | 111000122012110101200200 |
4 | 1332320001221003331 |
5 | 4213000221034003 |
6 | 142330040114113 |
7 | 12561641000001 |
oct | 1767001510375 |
9 | 430565411620 |
10 | 136231424253 |
11 | 528590a6431 |
12 | 2249b765939 |
13 | cb00baac12 |
14 | 6844d1a701 |
15 | 3824e616a3 |
hex | 1fb80690fd |
136231424253 has 6 divisors (see below), whose sum is σ = 196778723934. Its totient is φ = 90820949496.
The previous prime is 136231424239. The next prime is 136231424333. The reversal of 136231424253 is 352424132631.
136231424253 is a `hidden beast` number, since 1 + 3 + 623 + 1 + 4 + 2 + 4 + 25 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 129338771769 + 6892652484 = 359637^2 + 83022^2 .
It is not a de Polignac number, because 136231424253 - 28 = 136231423997 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136231429253) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7568412450 + ... + 7568412467.
It is an arithmetic number, because the mean of its divisors is an integer number (32796453989).
Almost surely, 2136231424253 is an apocalyptic number.
It is an amenable number.
136231424253 is a deficient number, since it is larger than the sum of its proper divisors (60547299681).
136231424253 is a wasteful number, since it uses less digits than its factorization.
136231424253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15136824923 (or 15136824920 counting only the distinct ones).
The product of its digits is 103680, while the sum is 36.
Adding to 136231424253 its reverse (352424132631), we get a palindrome (488655556884).
The spelling of 136231424253 in words is "one hundred thirty-six billion, two hundred thirty-one million, four hundred twenty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •