Base | Representation |
---|---|
bin | 11110111100111111110110… |
… | …010001001110001010001111 |
3 | 122212000012101012121110002102 |
4 | 132330333312101032022033 |
5 | 120320401112230000203 |
6 | 1201310405251545315 |
7 | 40450202423654624 |
oct | 3674776621161217 |
9 | 585005335543072 |
10 | 136133120156303 |
11 | 3a415806388386 |
12 | 133276165bb23b |
13 | 5ac63b505112a |
14 | 2588c419ba34b |
15 | 10b1205270888 |
hex | 7bcff644e28f |
136133120156303 has 2 divisors, whose sum is σ = 136133120156304. Its totient is φ = 136133120156302.
The previous prime is 136133120156227. The next prime is 136133120156329. The reversal of 136133120156303 is 303651021331631.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136133120156303 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136133120156353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68066560078151 + 68066560078152.
It is an arithmetic number, because the mean of its divisors is an integer number (68066560078152).
Almost surely, 2136133120156303 is an apocalyptic number.
136133120156303 is a deficient number, since it is larger than the sum of its proper divisors (1).
136133120156303 is an equidigital number, since it uses as much as digits as its factorization.
136133120156303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 38.
Adding to 136133120156303 its reverse (303651021331631), we get a palindrome (439784141487934).
The spelling of 136133120156303 in words is "one hundred thirty-six trillion, one hundred thirty-three billion, one hundred twenty million, one hundred fifty-six thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •