Base | Representation |
---|---|
bin | 11111111011100101101010… |
… | …100110010010111000111011 |
3 | 200102020101120012110221220021 |
4 | 133323211222212102320323 |
5 | 121401334004012213201 |
6 | 1214402350434111311 |
7 | 41403021500161054 |
oct | 3773455246227073 |
9 | 612211505427807 |
10 | 140434334101051 |
11 | 40823959536971 |
12 | 1390114641b537 |
13 | 6048b93312b63 |
14 | 26970b537b72b |
15 | 113804527bea1 |
hex | 7fb96a992e3b |
140434334101051 has 2 divisors, whose sum is σ = 140434334101052. Its totient is φ = 140434334101050.
The previous prime is 140434334101007. The next prime is 140434334101057. The reversal of 140434334101051 is 150101433434041.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140434334101051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140434334100998 and 140434334101016.
It is not a weakly prime, because it can be changed into another prime (140434334101057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70217167050525 + 70217167050526.
It is an arithmetic number, because the mean of its divisors is an integer number (70217167050526).
Almost surely, 2140434334101051 is an apocalyptic number.
140434334101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
140434334101051 is an equidigital number, since it uses as much as digits as its factorization.
140434334101051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 140434334101051 its reverse (150101433434041), we get a palindrome (290535767535092).
The spelling of 140434334101051 in words is "one hundred forty trillion, four hundred thirty-four billion, three hundred thirty-four million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •