Base | Representation |
---|---|
bin | 100000100010110000110110… |
… | …100000100001001010110001 |
3 | 200202202202021020012011122211 |
4 | 200202300312200201022301 |
5 | 122224440334043303113 |
6 | 1224223210153132121 |
7 | 42101353506341245 |
oct | 4042606640411261 |
9 | 622682236164584 |
10 | 143126404666033 |
11 | 41671627155468 |
12 | 14076a333ba041 |
13 | 61b29ba2a9a79 |
14 | 274b4d7d96425 |
15 | 11830a6104b3d |
hex | 822c368212b1 |
143126404666033 has 2 divisors, whose sum is σ = 143126404666034. Its totient is φ = 143126404666032.
The previous prime is 143126404666031. The next prime is 143126404666123. The reversal of 143126404666033 is 330666404621341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84346076416144 + 58780328249889 = 9184012^2 + 7666833^2 .
It is a cyclic number.
It is not a de Polignac number, because 143126404666033 - 21 = 143126404666031 is a prime.
Together with 143126404666031, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (143126404666031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71563202333016 + 71563202333017.
It is an arithmetic number, because the mean of its divisors is an integer number (71563202333017).
Almost surely, 2143126404666033 is an apocalyptic number.
It is an amenable number.
143126404666033 is a deficient number, since it is larger than the sum of its proper divisors (1).
143126404666033 is an equidigital number, since it uses as much as digits as its factorization.
143126404666033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4478976, while the sum is 49.
The spelling of 143126404666033 in words is "one hundred forty-three trillion, one hundred twenty-six billion, four hundred four million, six hundred sixty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •