Base | Representation |
---|---|
bin | 11110010000010010001010… |
… | …100111001011100000101001 |
3 | 122110010110011220210020221122 |
4 | 132100102022213023200221 |
5 | 114420030211030403044 |
6 | 1150555035355545025 |
7 | 40012204026421331 |
oct | 3620221247134051 |
9 | 573113156706848 |
10 | 133060412356649 |
11 | 39440670996688 |
12 | 12b0bbbaa5b175 |
13 | 593270a0bbc8b |
14 | 24c02306080c1 |
15 | 105b317844dee |
hex | 79048a9cb829 |
133060412356649 has 2 divisors, whose sum is σ = 133060412356650. Its totient is φ = 133060412356648.
The previous prime is 133060412356639. The next prime is 133060412356679. The reversal of 133060412356649 is 946653214060331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119695853113600 + 13364559243049 = 10940560^2 + 3655757^2 .
It is a cyclic number.
It is not a de Polignac number, because 133060412356649 - 28 = 133060412356393 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 133060412356649.
It is not a weakly prime, because it can be changed into another prime (133060412356609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66530206178324 + 66530206178325.
It is an arithmetic number, because the mean of its divisors is an integer number (66530206178325).
Almost surely, 2133060412356649 is an apocalyptic number.
It is an amenable number.
133060412356649 is a deficient number, since it is larger than the sum of its proper divisors (1).
133060412356649 is an equidigital number, since it uses as much as digits as its factorization.
133060412356649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8398080, while the sum is 53.
The spelling of 133060412356649 in words is "one hundred thirty-three trillion, sixty billion, four hundred twelve million, three hundred fifty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •