Base | Representation |
---|---|
bin | 1001010101001… |
… | …0111101100001 |
3 | 2201122101001000 |
4 | 2111102331201 |
5 | 40004341441 |
6 | 3514502213 |
7 | 653442252 |
oct | 225227541 |
9 | 81571030 |
10 | 39137121 |
11 | 20101331 |
12 | 11134969 |
13 | 8153b7a |
14 | 52aab29 |
15 | 36812b6 |
hex | 2552f61 |
39137121 has 8 divisors (see below), whose sum is σ = 57980960. Its totient is φ = 26091396.
The previous prime is 39137071. The next prime is 39137123. The reversal of 39137121 is 12173193.
39137121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 39137121 - 26 = 39137057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1449523 = 39137121 / (3 + 9 + 1 + 3 + 7 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (39137123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 724735 + ... + 724788.
It is an arithmetic number, because the mean of its divisors is an integer number (7247620).
Almost surely, 239137121 is an apocalyptic number.
It is an amenable number.
39137121 is a deficient number, since it is larger than the sum of its proper divisors (18843839).
39137121 is a wasteful number, since it uses less digits than its factorization.
39137121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449532 (or 1449526 counting only the distinct ones).
The product of its digits is 1134, while the sum is 27.
The square root of 39137121 is about 6255.9668317535. The cubic root of 39137121 is about 339.5181207038.
The spelling of 39137121 in words is "thirty-nine million, one hundred thirty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •