Base | Representation |
---|---|
bin | 11110011000100001011110… |
… | …011001100001001110010011 |
3 | 122112010120121221111201120101 |
4 | 132120201132121201032103 |
5 | 120003314242200324024 |
6 | 1152111114312153231 |
7 | 40101126605253205 |
oct | 3630413631411623 |
9 | 575116557451511 |
10 | 133626606261139 |
11 | 396397a8661272 |
12 | 12ba1894098817 |
13 | 5973c1cc94674 |
14 | 24dd7c2b66775 |
15 | 106ae04866c44 |
hex | 79885e661393 |
133626606261139 has 2 divisors, whose sum is σ = 133626606261140. Its totient is φ = 133626606261138.
The previous prime is 133626606261131. The next prime is 133626606261173. The reversal of 133626606261139 is 931162606626331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133626606261139 - 23 = 133626606261131 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133626606261139.
It is not a weakly prime, because it can be changed into another prime (133626606261131) 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, 66813303130569 + 66813303130570.
It is an arithmetic number, because the mean of its divisors is an integer number (66813303130570).
Almost surely, 2133626606261139 is an apocalyptic number.
133626606261139 is a deficient number, since it is larger than the sum of its proper divisors (1).
133626606261139 is an equidigital number, since it uses as much as digits as its factorization.
133626606261139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7558272, while the sum is 55.
The spelling of 133626606261139 in words is "one hundred thirty-three trillion, six hundred twenty-six billion, six hundred six million, two hundred sixty-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •