Base | Representation |
---|---|
bin | 100111100110001010… |
… | …110110101111110111 |
3 | 11001202000221101022100 |
4 | 213212022312233313 |
5 | 1144033133423111 |
6 | 31310504033143 |
7 | 3033410452365 |
oct | 474612665767 |
9 | 131660841270 |
10 | 42516311031 |
11 | 17038392837 |
12 | 82a67627b3 |
13 | 40174a2cbc |
14 | 20b4866635 |
15 | 118c885756 |
hex | 9e62b6bf7 |
42516311031 has 24 divisors (see below), whose sum is σ = 61762872080. Its totient is φ = 28182629376.
The previous prime is 42516311029. The next prime is 42516311099. The reversal of 42516311031 is 13011361524.
It is a happy number.
42516311031 is a `hidden beast` number, since 4 + 2 + 516 + 3 + 110 + 31 = 666.
It is not a de Polignac number, because 42516311031 - 21 = 42516311029 is a prime.
It is a super-2 number, since 2×425163110312 (a number of 22 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 = 42516310986 and 42516311004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42516311231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4071525 + ... + 4081953.
Almost surely, 242516311031 is an apocalyptic number.
42516311031 is a deficient number, since it is larger than the sum of its proper divisors (19246561049).
42516311031 is a wasteful number, since it uses less digits than its factorization.
42516311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12975 (or 12972 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 42516311031 its reverse (13011361524), we get a palindrome (55527672555).
The spelling of 42516311031 in words is "forty-two billion, five hundred sixteen million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •