Base | Representation |
---|---|
bin | 1000001101101001001… |
… | …0000001111011000111 |
3 | 111111012120122012212022 |
4 | 2003122102001323013 |
5 | 4302433341104111 |
6 | 144453154313355 |
7 | 13123421446244 |
oct | 2033222017307 |
9 | 444176565768 |
10 | 141101113031 |
11 | 5492799970a |
12 | 2341a58885b |
13 | 103c8a42478 |
14 | 6b8797a5cb |
15 | 3a0c7272db |
hex | 20da481ec7 |
141101113031 has 2 divisors, whose sum is σ = 141101113032. Its totient is φ = 141101113030.
The previous prime is 141101112989. The next prime is 141101113039. The reversal of 141101113031 is 130311101141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141101113031 - 26 = 141101112967 is a prime.
It is a super-2 number, since 2×1411011130312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141101113039) 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, 70550556515 + 70550556516.
It is an arithmetic number, because the mean of its divisors is an integer number (70550556516).
Almost surely, 2141101113031 is an apocalyptic number.
141101113031 is a deficient number, since it is larger than the sum of its proper divisors (1).
141101113031 is an equidigital number, since it uses as much as digits as its factorization.
141101113031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 141101113031 its reverse (130311101141), we get a palindrome (271412214172).
The spelling of 141101113031 in words is "one hundred forty-one billion, one hundred one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •