Base | Representation |
---|---|
bin | 1001011110001101… |
… | …1110111010011001 |
3 | 20120012110120112202 |
4 | 2113203132322121 |
5 | 20201410130043 |
6 | 1100150015545 |
7 | 120003156425 |
oct | 22743367231 |
9 | 6505416482 |
10 | 2542661273 |
11 | 10952a2059 |
12 | 5ab6475b5 |
13 | 316a183c9 |
14 | 1a1997b85 |
15 | ed3561b8 |
hex | 978dee99 |
2542661273 has 4 divisors (see below), whose sum is σ = 2590636068. Its totient is φ = 2494686480.
The previous prime is 2542661269. The next prime is 2542661279. The reversal of 2542661273 is 3721662452.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1628687449 + 913973824 = 40357^2 + 30232^2 .
It is a cyclic number.
It is not a de Polignac number, because 2542661273 - 22 = 2542661269 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 (2542661279) 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, 23987318 + ... + 23987423.
It is an arithmetic number, because the mean of its divisors is an integer number (647659017).
Almost surely, 22542661273 is an apocalyptic number.
It is an amenable number.
2542661273 is a deficient number, since it is larger than the sum of its proper divisors (47974795).
2542661273 is an equidigital number, since it uses as much as digits as its factorization.
2542661273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47974794.
The product of its digits is 120960, while the sum is 38.
The square root of 2542661273 is about 50424.8081106909. The cubic root of 2542661273 is about 1364.8853411273.
The spelling of 2542661273 in words is "two billion, five hundred forty-two million, six hundred sixty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •