Base | Representation |
---|---|
bin | 111100110111110… |
… | …1011001000001001 |
3 | 12021100101210220010 |
4 | 1321233223020021 |
5 | 13140342244203 |
6 | 534402422133 |
7 | 101421210504 |
oct | 17157531011 |
9 | 5240353803 |
10 | 2042540553 |
11 | 958a62a49 |
12 | 490061949 |
13 | 2672203a1 |
14 | 1553b013b |
15 | be4b7303 |
hex | 79beb209 |
2042540553 has 16 divisors (see below), whose sum is σ = 2895419520. Its totient is φ = 1277912064.
The previous prime is 2042540537. The next prime is 2042540561. The reversal of 2042540553 is 3550452402.
It is not a de Polignac number, because 2042540553 - 24 = 2042540537 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2042540553.
It is not an unprimeable number, because it can be changed into a prime (2042540153) 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 15 ways as a sum of consecutive naturals, for example, 275608 + ... + 282921.
It is an arithmetic number, because the mean of its divisors is an integer number (180963720).
Almost surely, 22042540553 is an apocalyptic number.
2042540553 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2042540553 is a deficient number, since it is larger than the sum of its proper divisors (852878967).
2042540553 is a wasteful number, since it uses less digits than its factorization.
2042540553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558608.
The product of its (nonzero) digits is 24000, while the sum is 30.
The square root of 2042540553 is about 45194.4748061088. The cubic root of 2042540553 is about 1268.7914087515.
Adding to 2042540553 its reverse (3550452402), we get a palindrome (5592992955).
The spelling of 2042540553 in words is "two billion, forty-two million, five hundred forty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •