Base | Representation |
---|---|
bin | 100100110000000100… |
… | …001010110111110001 |
3 | 10202212010000211201111 |
4 | 210300010022313301 |
5 | 1121304020331022 |
6 | 30043404233321 |
7 | 2564611600516 |
oct | 446004126761 |
9 | 122763024644 |
10 | 39461105137 |
11 | 1580a846393 |
12 | 779353b841 |
13 | 394b52c96c |
14 | 1ca4bad30d |
15 | 105e539477 |
hex | 93010adf1 |
39461105137 has 4 divisors (see below), whose sum is σ = 39499306660. Its totient is φ = 39422903616.
The previous prime is 39461105119. The next prime is 39461105141. The reversal of 39461105137 is 73150116493.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73150116493 = 17 ⋅4302948029.
It can be written as a sum of positive squares in 2 ways, for example, as 18558885361 + 20902219776 = 136231^2 + 144576^2 .
It is a cyclic number.
It is not a de Polignac number, because 39461105137 - 215 = 39461072369 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 39461105137.
It is not an unprimeable number, because it can be changed into a prime (39461105197) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19099212 + ... + 19101277.
It is an arithmetic number, because the mean of its divisors is an integer number (9874826665).
Almost surely, 239461105137 is an apocalyptic number.
It is an amenable number.
39461105137 is a deficient number, since it is larger than the sum of its proper divisors (38201523).
39461105137 is a wasteful number, since it uses less digits than its factorization.
39461105137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38201522.
The product of its (nonzero) digits is 68040, while the sum is 40.
The spelling of 39461105137 in words is "thirty-nine billion, four hundred sixty-one million, one hundred five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •