Base | Representation |
---|---|
bin | 10011001001010001111110… |
… | …10010110001011100101011 |
3 | 12112001202022110212001200021 |
4 | 21210220333102301130223 |
5 | 21004232434304234011 |
6 | 225312343013421311 |
7 | 11603435312520106 |
oct | 1144507722613453 |
9 | 175052273761607 |
10 | 42100331321131 |
11 | 12461717528476 |
12 | 487b3ab93a837 |
13 | 1a65076184775 |
14 | a57949dd373d |
15 | 4d01d607d471 |
hex | 264a3f4b172b |
42100331321131 has 16 divisors (see below), whose sum is σ = 43285652844544. Its totient is φ = 40917532908384.
The previous prime is 42100331321071. The next prime is 42100331321161. The reversal of 42100331321131 is 13112313300124.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42100331321131 is a prime.
It is a super-2 number, since 2×421003313211312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42100331321096 and 42100331321105.
It is not an unprimeable number, because it can be changed into a prime (42100331321161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 125226646 + ... + 125562388.
It is an arithmetic number, because the mean of its divisors is an integer number (2705353302784).
Almost surely, 242100331321131 is an apocalyptic number.
42100331321131 is a deficient number, since it is larger than the sum of its proper divisors (1185321523413).
42100331321131 is a wasteful number, since it uses less digits than its factorization.
42100331321131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339490.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 42100331321131 its reverse (13112313300124), we get a palindrome (55212644621255).
The spelling of 42100331321131 in words is "forty-two trillion, one hundred billion, three hundred thirty-one million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •