Base | Representation |
---|---|
bin | 11110011010010010010110… |
… | …101101010111001000001001 |
3 | 122112120011110211212012211001 |
4 | 132122102112231113020021 |
5 | 120012311003334233144 |
6 | 1152242521250335001 |
7 | 40112650262532406 |
oct | 3632222655271011 |
9 | 575504424765731 |
10 | 133747810071049 |
11 | 39686144a94609 |
12 | 1300127ab8a461 |
13 | 59824976a8395 |
14 | 25055ddd112ad |
15 | 106e14a35bbd4 |
hex | 79a496b57209 |
133747810071049 has 2 divisors, whose sum is σ = 133747810071050. Its totient is φ = 133747810071048.
The previous prime is 133747810071047. The next prime is 133747810071119. The reversal of 133747810071049 is 940170018747331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130240591290000 + 3507218781049 = 11412300^2 + 1872757^2 .
It is a cyclic number.
It is not a de Polignac number, because 133747810071049 - 21 = 133747810071047 is a prime.
Together with 133747810071047, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (133747810071047) 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, 66873905035524 + 66873905035525.
It is an arithmetic number, because the mean of its divisors is an integer number (66873905035525).
Almost surely, 2133747810071049 is an apocalyptic number.
It is an amenable number.
133747810071049 is a deficient number, since it is larger than the sum of its proper divisors (1).
133747810071049 is an equidigital number, since it uses as much as digits as its factorization.
133747810071049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3556224, while the sum is 55.
The spelling of 133747810071049 in words is "one hundred thirty-three trillion, seven hundred forty-seven billion, eight hundred ten million, seventy-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •