Base | Representation |
---|---|
bin | 111111001110101… |
… | …0010001110101101 |
3 | 12110212011202101021 |
4 | 1332131102032231 |
5 | 13321112343221 |
6 | 550305214141 |
7 | 103401232261 |
oct | 17635221655 |
9 | 5425152337 |
10 | 2121606061 |
11 | 999656043 |
12 | 4b2631351 |
13 | 27a714303 |
14 | 161ab20a1 |
15 | c63d4041 |
hex | 7e7523ad |
2121606061 has 4 divisors (see below), whose sum is σ = 2121881632. Its totient is φ = 2121330492.
The previous prime is 2121606031. The next prime is 2121606163. The reversal of 2121606061 is 1606061212.
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.
It is a cyclic number.
It is not a de Polignac number, because 2121606061 - 213 = 2121597869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121606031) 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 in 3 ways as a sum of consecutive naturals, for example, 125895 + ... + 141748.
It is an arithmetic number, because the mean of its divisors is an integer number (530470408).
Almost surely, 22121606061 is an apocalyptic number.
It is an amenable number.
2121606061 is a deficient number, since it is larger than the sum of its proper divisors (275571).
2121606061 is an equidigital number, since it uses as much as digits as its factorization.
2121606061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275570.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 2121606061 is about 46060.8951389354. The cubic root of 2121606061 is about 1284.9559778405.
Adding to 2121606061 its reverse (1606061212), we get a palindrome (3727667273).
The spelling of 2121606061 in words is "two billion, one hundred twenty-one million, six hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •