Base | Representation |
---|---|
bin | 10010101100011111011010… |
… | …10110010000010011000011 |
3 | 12101120011222012222200222121 |
4 | 21112033231112100103003 |
5 | 20342031030142233011 |
6 | 223234103545545111 |
7 | 11442115505316004 |
oct | 1126175526202303 |
9 | 171504865880877 |
10 | 41111114024131 |
11 | 12110142113978 |
12 | 473b738aa5197 |
13 | 19c29b8ab1278 |
14 | a21b07a551ab |
15 | 4b45db281e71 |
hex | 2563ed5904c3 |
41111114024131 has 2 divisors, whose sum is σ = 41111114024132. Its totient is φ = 41111114024130.
The previous prime is 41111114024129. The next prime is 41111114024137. The reversal of 41111114024131 is 13142041111114.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 41111114024131 - 21 = 41111114024129 is a prime.
It is a super-2 number, since 2×411111140241312 (a number of 28 digits) contains 22 as substring.
Together with 41111114024129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 41111114024096 and 41111114024105.
It is not a weakly prime, because it can be changed into another prime (41111114024137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20555557012065 + 20555557012066.
It is an arithmetic number, because the mean of its divisors is an integer number (20555557012066).
Almost surely, 241111114024131 is an apocalyptic number.
41111114024131 is a deficient number, since it is larger than the sum of its proper divisors (1).
41111114024131 is an equidigital number, since it uses as much as digits as its factorization.
41111114024131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 25.
Adding to 41111114024131 its reverse (13142041111114), we get a palindrome (54253155135245).
The spelling of 41111114024131 in words is "forty-one trillion, one hundred eleven billion, one hundred fourteen million, twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •