Base | Representation |
---|---|
bin | 100000001010000101000100… |
… | …101110011001001011011111 |
3 | 200112202120220000012221011202 |
4 | 200022011010232121023133 |
5 | 122014142402030234211 |
6 | 1220444034423510115 |
7 | 41534663331056603 |
oct | 4012050456311337 |
9 | 615676800187152 |
10 | 141430131102431 |
11 | 410781aaa27786 |
12 | 13a421348b833b |
13 | 60bba5b8c2b62 |
14 | 26cd37d50b503 |
15 | 1153dc7a2053b |
hex | 80a144b992df |
141430131102431 has 2 divisors, whose sum is σ = 141430131102432. Its totient is φ = 141430131102430.
The previous prime is 141430131102427. The next prime is 141430131102439. The reversal of 141430131102431 is 134201131034141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141430131102431 - 22 = 141430131102427 is a prime.
It is a super-2 number, since 2×1414301311024312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 141430131102394 and 141430131102403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141430131102439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70715065551215 + 70715065551216.
It is an arithmetic number, because the mean of its divisors is an integer number (70715065551216).
Almost surely, 2141430131102431 is an apocalyptic number.
141430131102431 is a deficient number, since it is larger than the sum of its proper divisors (1).
141430131102431 is an equidigital number, since it uses as much as digits as its factorization.
141430131102431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 141430131102431 its reverse (134201131034141), we get a palindrome (275631262136572).
The spelling of 141430131102431 in words is "one hundred forty-one trillion, four hundred thirty billion, one hundred thirty-one million, one hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •