Base | Representation |
---|---|
bin | 10011000111010000110110… |
… | …11100011111111000110011 |
3 | 12111211010101101100010021021 |
4 | 21203220123130133320303 |
5 | 21002114002131223011 |
6 | 225220440222040311 |
7 | 11565432422524324 |
oct | 1143503334377063 |
9 | 174733341303237 |
10 | 42031010414131 |
11 | 124352846a5a92 |
12 | 4869a84419097 |
13 | 1a5b6796392bb |
14 | a5445167244b |
15 | 4cd4ca3b0471 |
hex | 263a1b71fe33 |
42031010414131 has 32 divisors (see below), whose sum is σ = 47325043584000. Its totient is φ = 37143758919168.
The previous prime is 42031010414123. The next prime is 42031010414137. The reversal of 42031010414131 is 13141401013024.
It is a cyclic number.
It is not a de Polignac number, because 42031010414131 - 23 = 42031010414123 is a prime.
It is a super-2 number, since 2×420310104141312 (a number of 28 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 = 42031010414096 and 42031010414105.
It is not an unprimeable number, because it can be changed into a prime (42031010414137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4562751 + ... + 10241128.
It is an arithmetic number, because the mean of its divisors is an integer number (1478907612000).
Almost surely, 242031010414131 is an apocalyptic number.
42031010414131 is a deficient number, since it is larger than the sum of its proper divisors (5294033169869).
42031010414131 is a wasteful number, since it uses less digits than its factorization.
42031010414131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14804083.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 42031010414131 its reverse (13141401013024), we get a palindrome (55172411427155).
The spelling of 42031010414131 in words is "forty-two trillion, thirty-one billion, ten million, four hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •