Base | Representation |
---|---|
bin | 11110010000010001110010… |
… | …110100010010100001010001 |
3 | 122110010102011002120221201122 |
4 | 132100101302310102201101 |
5 | 114420023401330440144 |
6 | 1150554532015212025 |
7 | 40012161111221462 |
oct | 3620216264224121 |
9 | 573112132527648 |
10 | 133060013140049 |
11 | 39440486606306 |
12 | 12b0bb09217015 |
13 | 5932675493138 |
14 | 24c01d35a8d69 |
15 | 105b2e27887ee |
hex | 790472d12851 |
133060013140049 has 2 divisors, whose sum is σ = 133060013140050. Its totient is φ = 133060013140048.
The previous prime is 133060013139983. The next prime is 133060013140051. The reversal of 133060013140049 is 940041310060331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110862789139600 + 22197224000449 = 10529140^2 + 4711393^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133060013140049 is a prime.
Together with 133060013140051, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (133060013140069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66530006570024 + 66530006570025.
It is an arithmetic number, because the mean of its divisors is an integer number (66530006570025).
Almost surely, 2133060013140049 is an apocalyptic number.
It is an amenable number.
133060013140049 is a deficient number, since it is larger than the sum of its proper divisors (1).
133060013140049 is an equidigital number, since it uses as much as digits as its factorization.
133060013140049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 133060013140049 in words is "one hundred thirty-three trillion, sixty billion, thirteen million, one hundred forty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •