Base | Representation |
---|---|
bin | 111100010001111010111… |
… | …100010011111110000011 |
3 | 112200000021202022100202100 |
4 | 330101322330103332003 |
5 | 1020332124220313011 |
6 | 12450555234121443 |
7 | 605164544264406 |
oct | 74217274237603 |
9 | 15600252270670 |
10 | 4142411104131 |
11 | 1357872091a53 |
12 | 56a9b1120283 |
13 | 240821063661 |
14 | 1046cac7bd3d |
15 | 72b486e7d56 |
hex | 3c47af13f83 |
4142411104131 has 6 divisors (see below), whose sum is σ = 5983482705980. Its totient is φ = 2761607402748.
The previous prime is 4142411104127. The next prime is 4142411104217. The reversal of 4142411104131 is 1314011142414.
4142411104131 is a `hidden beast` number, since 4 + 1 + 4 + 241 + 1 + 1 + 0 + 413 + 1 = 666.
It is not a de Polignac number, because 4142411104131 - 22 = 4142411104127 is a prime.
It is a super-2 number, since 2×41424111041312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4142411104095 and 4142411104104.
It is not an unprimeable number, because it can be changed into a prime (4142411104031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 230133950221 + ... + 230133950238.
Almost surely, 24142411104131 is an apocalyptic number.
4142411104131 is a deficient number, since it is larger than the sum of its proper divisors (1841071601849).
4142411104131 is a wasteful number, since it uses less digits than its factorization.
4142411104131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460267900465 (or 460267900462 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 4142411104131 its reverse (1314011142414), we get a palindrome (5456422246545).
The spelling of 4142411104131 in words is "four trillion, one hundred forty-two billion, four hundred eleven million, one hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •