Base | Representation |
---|---|
bin | 11110011110010100100010… |
… | …011011110111001110101011 |
3 | 122120112200000221012120011101 |
4 | 132132110202123313032223 |
5 | 120031331231220414011 |
6 | 1153014125542542231 |
7 | 40141663145003041 |
oct | 3636244233671653 |
9 | 576480027176141 |
10 | 134025032201131 |
11 | 3978277371a025 |
12 | 13046b48137977 |
13 | 59a267747cc46 |
14 | 2514bbbc68391 |
15 | 1076472e872c1 |
hex | 79e5226f73ab |
134025032201131 has 2 divisors, whose sum is σ = 134025032201132. Its totient is φ = 134025032201130.
The previous prime is 134025032201111. The next prime is 134025032201297. The reversal of 134025032201131 is 131102230520431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 134025032201131 - 27 = 134025032201003 is a prime.
It is a super-2 number, since 2×1340250322011312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 134025032201131.
It is not a weakly prime, because it can be changed into another prime (134025032201111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67012516100565 + 67012516100566.
It is an arithmetic number, because the mean of its divisors is an integer number (67012516100566).
Almost surely, 2134025032201131 is an apocalyptic number.
134025032201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
134025032201131 is an equidigital number, since it uses as much as digits as its factorization.
134025032201131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 134025032201131 its reverse (131102230520431), we get a palindrome (265127262721562).
The spelling of 134025032201131 in words is "one hundred thirty-four trillion, twenty-five billion, thirty-two million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •