Base | Representation |
---|---|
bin | 1000010101001100111… |
… | …0001100100001110011 |
3 | 111200102222122000201201 |
4 | 2011103032030201303 |
5 | 4321112304313102 |
6 | 145430355512031 |
7 | 13224620132023 |
oct | 2052316144163 |
9 | 450388560651 |
10 | 143130151027 |
11 | 55779269a16 |
12 | 238a5bb8617 |
13 | 10660215976 |
14 | 6cdb233a83 |
15 | 3aca923987 |
hex | 215338c873 |
143130151027 has 2 divisors, whose sum is σ = 143130151028. Its totient is φ = 143130151026.
The previous prime is 143130151007. The next prime is 143130151049. The reversal of 143130151027 is 720151031341.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 143130151027 - 223 = 143121762419 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143130150986 and 143130151004.
It is not a weakly prime, because it can be changed into another prime (143130151007) 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, 71565075513 + 71565075514.
It is an arithmetic number, because the mean of its divisors is an integer number (71565075514).
Almost surely, 2143130151027 is an apocalyptic number.
143130151027 is a deficient number, since it is larger than the sum of its proper divisors (1).
143130151027 is an equidigital number, since it uses as much as digits as its factorization.
143130151027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 28.
Adding to 143130151027 its reverse (720151031341), we get a palindrome (863281182368).
The spelling of 143130151027 in words is "one hundred forty-three billion, one hundred thirty million, one hundred fifty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •