Base | Representation |
---|---|
bin | 1011011100101100… |
… | …0110000111000001 |
3 | 21221011122122101001 |
4 | 2313023012013001 |
5 | 22243210423022 |
6 | 1224540012001 |
7 | 136104152215 |
oct | 26713060701 |
9 | 7834578331 |
10 | 3073139137 |
11 | 1337785a12 |
12 | 719231001 |
13 | 39c8b1b33 |
14 | 212204945 |
15 | 12ebdeb27 |
hex | b72c61c1 |
3073139137 has 2 divisors, whose sum is σ = 3073139138. Its totient is φ = 3073139136.
The previous prime is 3073139131. The next prime is 3073139141. The reversal of 3073139137 is 7319313703.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3011924161 + 61214976 = 54881^2 + 7824^2 .
It is a cyclic number.
It is not a de Polignac number, because 3073139137 - 215 = 3073106369 is a prime.
It is a super-2 number, since 2×30731391372 = 18888368310722209538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3073139096 and 3073139105.
It is not a weakly prime, because it can be changed into another prime (3073139131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1536569568 + 1536569569.
It is an arithmetic number, because the mean of its divisors is an integer number (1536569569).
Almost surely, 23073139137 is an apocalyptic number.
It is an amenable number.
3073139137 is a deficient number, since it is larger than the sum of its proper divisors (1).
3073139137 is an equidigital number, since it uses as much as digits as its factorization.
3073139137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35721, while the sum is 37.
The square root of 3073139137 is about 55435.9011562002. The cubic root of 3073139137 is about 1453.8761351597.
The spelling of 3073139137 in words is "three billion, seventy-three million, one hundred thirty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •