Base | Representation |
---|---|
bin | 11110010001110011111101… |
… | …111100010111100110011111 |
3 | 122110111111020112102210012212 |
4 | 132101303331330113212133 |
5 | 114423240243141144033 |
6 | 1151115204041351035 |
7 | 40022612260105433 |
oct | 3621637574274637 |
9 | 573444215383185 |
10 | 133165426506143 |
11 | 3948115a713489 |
12 | 12b28427a9847b |
13 | 593c5a4672785 |
14 | 24c53535709c3 |
15 | 105de11d7d748 |
hex | 791cfdf1799f |
133165426506143 has 16 divisors (see below), whose sum is σ = 143457695846400. Its totient is φ = 123249511059840.
The previous prime is 133165426506059. The next prime is 133165426506179. The reversal of 133165426506143 is 341605624561331.
It is a cyclic number.
It is not a de Polignac number, because 133165426506143 - 240 = 132065914878367 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133165426506091 and 133165426506100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133165426506743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7939898 + ... + 18148631.
It is an arithmetic number, because the mean of its divisors is an integer number (8966105990400).
Almost surely, 2133165426506143 is an apocalyptic number.
133165426506143 is a deficient number, since it is larger than the sum of its proper divisors (10292269340257).
133165426506143 is a wasteful number, since it uses less digits than its factorization.
133165426506143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26095742.
The product of its (nonzero) digits is 4665600, while the sum is 50.
The spelling of 133165426506143 in words is "one hundred thirty-three trillion, one hundred sixty-five billion, four hundred twenty-six million, five hundred six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •