Base | Representation |
---|---|
bin | 1001110110000000… |
… | …0010010100111101 |
3 | 20211011011220020102 |
4 | 2131200002110331 |
5 | 20402424433203 |
6 | 1114112130445 |
7 | 122324131316 |
oct | 23540022475 |
9 | 6734156212 |
10 | 2642421053 |
11 | 113663a058 |
12 | 618b36a25 |
13 | 3315a676c |
14 | 1b0d2560d |
15 | 106eae888 |
hex | 9d80253d |
2642421053 has 4 divisors (see below), whose sum is σ = 2692278108. Its totient is φ = 2592564000.
The previous prime is 2642421049. The next prime is 2642421109. The reversal of 2642421053 is 3501242462.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3501242462 = 2 ⋅1750621231.
It can be written as a sum of positive squares in 2 ways, for example, as 2052271204 + 590149849 = 45302^2 + 24293^2 .
It is a cyclic number.
It is not a de Polignac number, because 2642421053 - 22 = 2642421049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2642471053) 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, 24928448 + ... + 24928553.
It is an arithmetic number, because the mean of its divisors is an integer number (673069527).
Almost surely, 22642421053 is an apocalyptic number.
It is an amenable number.
2642421053 is a deficient number, since it is larger than the sum of its proper divisors (49857055).
2642421053 is an equidigital number, since it uses as much as digits as its factorization.
2642421053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49857054.
The product of its (nonzero) digits is 11520, while the sum is 29.
The square root of 2642421053 is about 51404.4847557098. The cubic root of 2642421053 is about 1382.5070043147.
The spelling of 2642421053 in words is "two billion, six hundred forty-two million, four hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •