Base | Representation |
---|---|
bin | 111101111100011111… |
… | …0000011001111011001 |
3 | 110201100210221201210012 |
4 | 1323320332003033121 |
5 | 4134414131102044 |
6 | 141040013331305 |
7 | 12416336431544 |
oct | 1737076031731 |
9 | 421323851705 |
10 | 133026034649 |
11 | 51463801812 |
12 | 21946196b35 |
13 | c70caa3191 |
14 | 661d32b85b |
15 | 36d884b59e |
hex | 1ef8f833d9 |
133026034649 has 2 divisors, whose sum is σ = 133026034650. Its totient is φ = 133026034648.
The previous prime is 133026034607. The next prime is 133026034657. The reversal of 133026034649 is 946430620331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124702209424 + 8323825225 = 353132^2 + 91235^2 .
It is a cyclic number.
It is not a de Polignac number, because 133026034649 - 216 = 133025969113 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (133026034549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66513017324 + 66513017325.
It is an arithmetic number, because the mean of its divisors is an integer number (66513017325).
Almost surely, 2133026034649 is an apocalyptic number.
It is an amenable number.
133026034649 is a deficient number, since it is larger than the sum of its proper divisors (1).
133026034649 is an equidigital number, since it uses as much as digits as its factorization.
133026034649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 133026034649 in words is "one hundred thirty-three billion, twenty-six million, thirty-four thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •