Base | Representation |
---|---|
bin | 1011100100001011… |
… | …1001100101100001 |
3 | 22000100202020021122 |
4 | 2321002321211201 |
5 | 22324230420441 |
6 | 1232021102025 |
7 | 136635124646 |
oct | 27102714541 |
9 | 8010666248 |
10 | 3104545121 |
11 | 1353486777 |
12 | 727857915 |
13 | 3a6259a62 |
14 | 21645bdcd |
15 | 13284534b |
hex | b90b9961 |
3104545121 has 4 divisors (see below), whose sum is σ = 3118467072. Its totient is φ = 3090623172.
The previous prime is 3104545079. The next prime is 3104545139. The reversal of 3104545121 is 1215454013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1215454013 = 3221 ⋅377353.
It is a cyclic number.
It is not a de Polignac number, because 3104545121 - 26 = 3104545057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3104545621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6960641 + ... + 6961086.
It is an arithmetic number, because the mean of its divisors is an integer number (779616768).
Almost surely, 23104545121 is an apocalyptic number.
It is an amenable number.
3104545121 is a deficient number, since it is larger than the sum of its proper divisors (13921951).
3104545121 is a wasteful number, since it uses less digits than its factorization.
3104545121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13921950.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 3104545121 is about 55718.4450698330. The cubic root of 3104545121 is about 1458.8119942657.
Adding to 3104545121 its reverse (1215454013), we get a palindrome (4319999134).
The spelling of 3104545121 in words is "three billion, one hundred four million, five hundred forty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •