Base | Representation |
---|---|
bin | 100000011011100010100100… |
… | …100110100111101100011011 |
3 | 200201000022001102010122001021 |
4 | 200123202210212213230123 |
5 | 122143322303100144201 |
6 | 1223203200032303311 |
7 | 42020452146445204 |
oct | 4033424446475433 |
9 | 621008042118037 |
10 | 142630035553051 |
11 | 414a0070792142 |
12 | 13bb67a63a1b37 |
13 | 6177c54464a67 |
14 | 273148b0825ab |
15 | 1175204134ea1 |
hex | 81b8a49a7b1b |
142630035553051 has 2 divisors, whose sum is σ = 142630035553052. Its totient is φ = 142630035553050.
The previous prime is 142630035553037. The next prime is 142630035553127. The reversal of 142630035553051 is 150355530036241.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142630035553051 - 29 = 142630035552539 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142630035552989 and 142630035553007.
It is not a weakly prime, because it can be changed into another prime (142630035553021) 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, 71315017776525 + 71315017776526.
It is an arithmetic number, because the mean of its divisors is an integer number (71315017776526).
Almost surely, 2142630035553051 is an apocalyptic number.
142630035553051 is a deficient number, since it is larger than the sum of its proper divisors (1).
142630035553051 is an equidigital number, since it uses as much as digits as its factorization.
142630035553051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810000, while the sum is 43.
Adding to 142630035553051 its reverse (150355530036241), we get a palindrome (292985565589292).
The spelling of 142630035553051 in words is "one hundred forty-two trillion, six hundred thirty billion, thirty-five million, five hundred fifty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •