Base | Representation |
---|---|
bin | 1101101110000110… |
… | …1101001011111001 |
3 | 100111200022010111012 |
4 | 3123201231023321 |
5 | 30020324434022 |
6 | 1405244243305 |
7 | 160161242561 |
oct | 33341551371 |
9 | 10450263435 |
10 | 3683046137 |
11 | 161aa90091 |
12 | 869540535 |
13 | 469068b54 |
14 | 26d209da1 |
15 | 168517de2 |
hex | db86d2f9 |
3683046137 has 2 divisors, whose sum is σ = 3683046138. Its totient is φ = 3683046136.
The previous prime is 3683046131. The next prime is 3683046163. The reversal of 3683046137 is 7316403863.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3442051561 + 240994576 = 58669^2 + 15524^2 .
It is an emirp because it is prime and its reverse (7316403863) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3683046137 - 228 = 3414610681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3683046094 and 3683046103.
It is not a weakly prime, because it can be changed into another prime (3683046131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1841523068 + 1841523069.
It is an arithmetic number, because the mean of its divisors is an integer number (1841523069).
Almost surely, 23683046137 is an apocalyptic number.
It is an amenable number.
3683046137 is a deficient number, since it is larger than the sum of its proper divisors (1).
3683046137 is an equidigital number, since it uses as much as digits as its factorization.
3683046137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 41.
The square root of 3683046137 is about 60688.1053996580. The cubic root of 3683046137 is about 1544.3143953419.
The spelling of 3683046137 in words is "three billion, six hundred eighty-three million, forty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •