Base | Representation |
---|---|
bin | 11110100010011110111000… |
… | …101111010100101001111101 |
3 | 122121120000020000221201121111 |
4 | 132202132320233110221331 |
5 | 120101022433030220313 |
6 | 1153353344231002021 |
7 | 40201436216602204 |
oct | 3642367057245175 |
9 | 577500200851544 |
10 | 134311021726333 |
11 | 39882a91313231 |
12 | 13092461509311 |
13 | 59c3623772c7a |
14 | 252498c36823b |
15 | 107db1064443d |
hex | 7a27b8bd4a7d |
134311021726333 has 2 divisors, whose sum is σ = 134311021726334. Its totient is φ = 134311021726332.
The previous prime is 134311021726307. The next prime is 134311021726337. The reversal of 134311021726333 is 333627120113431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75980562522489 + 58330459203844 = 8716683^2 + 7637438^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134311021726333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134311021726337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67155510863166 + 67155510863167.
It is an arithmetic number, because the mean of its divisors is an integer number (67155510863167).
Almost surely, 2134311021726333 is an apocalyptic number.
It is an amenable number.
134311021726333 is a deficient number, since it is larger than the sum of its proper divisors (1).
134311021726333 is an equidigital number, since it uses as much as digits as its factorization.
134311021726333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 163296, while the sum is 40.
Adding to 134311021726333 its reverse (333627120113431), we get a palindrome (467938141839764).
The spelling of 134311021726333 in words is "one hundred thirty-four trillion, three hundred eleven billion, twenty-one million, seven hundred twenty-six thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •