Base | Representation |
---|---|
bin | 11111000001001111011011… |
… | …111001101101111001110101 |
3 | 122220001002002101110000121221 |
4 | 133001033123321231321311 |
5 | 120340140324301012011 |
6 | 1202052354110110341 |
7 | 40510235061015046 |
oct | 3701173371557165 |
9 | 586032071400557 |
10 | 136424735563381 |
11 | 3a518450704941 |
12 | 1337403baab3b1 |
13 | 5b17a49a61045 |
14 | 2598dc73408cd |
15 | 10b8ac17b5971 |
hex | 7c13dbe6de75 |
136424735563381 has 2 divisors, whose sum is σ = 136424735563382. Its totient is φ = 136424735563380.
The previous prime is 136424735563327. The next prime is 136424735563393. The reversal of 136424735563381 is 183365537424631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128673494912356 + 7751240651025 = 11343434^2 + 2784105^2 .
It is a cyclic number.
It is not a de Polignac number, because 136424735563381 - 211 = 136424735561333 is a prime.
It is a super-2 number, since 2×1364247355633812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136424735563301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68212367781690 + 68212367781691.
It is an arithmetic number, because the mean of its divisors is an integer number (68212367781691).
Almost surely, 2136424735563381 is an apocalyptic number.
It is an amenable number.
136424735563381 is a deficient number, since it is larger than the sum of its proper divisors (1).
136424735563381 is an equidigital number, since it uses as much as digits as its factorization.
136424735563381 is an evil number, because the sum of its binary digits is even.
The product of its digits is 130636800, while the sum is 61.
The spelling of 136424735563381 in words is "one hundred thirty-six trillion, four hundred twenty-four billion, seven hundred thirty-five million, five hundred sixty-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •