Base | Representation |
---|---|
bin | 1101101010111110… |
… | …1011010011101001 |
3 | 100110202121211020022 |
4 | 3122233223103221 |
5 | 30004000244431 |
6 | 1404055210225 |
7 | 156641620664 |
oct | 33257532351 |
9 | 10422554208 |
10 | 3669931241 |
11 | 1613642729 |
12 | 865076975 |
13 | 466426562 |
14 | 26b5946db |
15 | 1672c707b |
hex | dabeb4e9 |
3669931241 has 2 divisors, whose sum is σ = 3669931242. Its totient is φ = 3669931240.
The previous prime is 3669931207. The next prime is 3669931273. The reversal of 3669931241 is 1421399663.
3669931241 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2920321600 + 749609641 = 54040^2 + 27379^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3669931241 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3669931192 and 3669931201.
It is not a weakly prime, because it can be changed into another prime (3669931541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1834965620 + 1834965621.
It is an arithmetic number, because the mean of its divisors is an integer number (1834965621).
Almost surely, 23669931241 is an apocalyptic number.
It is an amenable number.
3669931241 is a deficient number, since it is larger than the sum of its proper divisors (1).
3669931241 is an equidigital number, since it uses as much as digits as its factorization.
3669931241 is an evil number, because the sum of its binary digits is even.
The product of its digits is 209952, while the sum is 44.
The square root of 3669931241 is about 60579.9574199256. The cubic root of 3669931241 is about 1542.4791743732.
The spelling of 3669931241 in words is "three billion, six hundred sixty-nine million, nine hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •