Base | Representation |
---|---|
bin | 110100100001111111000… |
… | …100100100111010011001 |
3 | 110210002210110001202022101 |
4 | 310201333010210322121 |
5 | 433121041013403331 |
6 | 11402211152123401 |
7 | 521543540262325 |
oct | 64417704447231 |
9 | 13702713052271 |
10 | 3609904434841 |
11 | 1171a51a41811 |
12 | 4a3759836561 |
13 | 202549427833 |
14 | c6a12744985 |
15 | 63d7dd94061 |
hex | 3487f124e99 |
3609904434841 has 2 divisors, whose sum is σ = 3609904434842. Its totient is φ = 3609904434840.
The previous prime is 3609904434727. The next prime is 3609904434889. The reversal of 3609904434841 is 1484344099063.
3609904434841 is digitally balanced in base 2, 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., 3156947168400 + 452957266441 = 1776780^2 + 673021^2 .
It is a cyclic number.
It is not a de Polignac number, because 3609904434841 - 219 = 3609903910553 is a prime.
It is a super-2 number, since 2×36099044348412 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3609904438841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1804952217420 + 1804952217421.
It is an arithmetic number, because the mean of its divisors is an integer number (1804952217421).
Almost surely, 23609904434841 is an apocalyptic number.
It is an amenable number.
3609904434841 is a deficient number, since it is larger than the sum of its proper divisors (1).
3609904434841 is an equidigital number, since it uses as much as digits as its factorization.
3609904434841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8957952, while the sum is 55.
The spelling of 3609904434841 in words is "three trillion, six hundred nine billion, nine hundred four million, four hundred thirty-four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •