Base | Representation |
---|---|
bin | 111111001110010… |
… | …0100110100010101 |
3 | 12110211211022020002 |
4 | 1332130210310111 |
5 | 13321040420203 |
6 | 550301221045 |
7 | 103366526054 |
oct | 17634446425 |
9 | 5424738202 |
10 | 2121420053 |
11 | 999539315 |
12 | 4b2561785 |
13 | 27a67a74c |
14 | 161a6439b |
15 | c6398d88 |
hex | 7e724d15 |
2121420053 has 4 divisors (see below), whose sum is σ = 2233073760. Its totient is φ = 2009766348.
The previous prime is 2121420023. The next prime is 2121420071. The reversal of 2121420053 is 3500241212.
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 2121420053 - 212 = 2121415957 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 (2121420023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55826825 + ... + 55826862.
It is an arithmetic number, because the mean of its divisors is an integer number (558268440).
Almost surely, 22121420053 is an apocalyptic number.
It is an amenable number.
2121420053 is a deficient number, since it is larger than the sum of its proper divisors (111653707).
2121420053 is a wasteful number, since it uses less digits than its factorization.
2121420053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111653706.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 2121420053 is about 46058.8759415598. The cubic root of 2121420053 is about 1284.9184246741.
Adding to 2121420053 its reverse (3500241212), we get a palindrome (5621661265).
The spelling of 2121420053 in words is "two billion, one hundred twenty-one million, four hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •