Base | Representation |
---|---|
bin | 1001000001010101… |
… | …1110101111100101 |
3 | 20020202120111012000 |
4 | 2100111132233211 |
5 | 14424404100203 |
6 | 1040142115513 |
7 | 114002556456 |
oct | 22025365745 |
9 | 6222514160 |
10 | 2421550053 |
11 | 10329a143a |
12 | 576b7bb99 |
13 | 2c78c2770 |
14 | 18d86d12d |
15 | e28d14a3 |
hex | 9055ebe5 |
2421550053 has 32 divisors (see below), whose sum is σ = 3868193280. Its totient is φ = 1488352320.
The previous prime is 2421550051. The next prime is 2421550067. The reversal of 2421550053 is 3500551242.
It is a happy number.
It is not a de Polignac number, because 2421550053 - 21 = 2421550051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2421549999 and 2421550026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2421550051) 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 31 ways as a sum of consecutive naturals, for example, 315975 + ... + 323547.
It is an arithmetic number, because the mean of its divisors is an integer number (120881040).
Almost surely, 22421550053 is an apocalyptic number.
It is an amenable number.
2421550053 is a deficient number, since it is larger than the sum of its proper divisors (1446643227).
2421550053 is a wasteful number, since it uses less digits than its factorization.
2421550053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8506 (or 8500 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 2421550053 is about 49209.2476370042. The cubic root of 2421550053 is about 1342.8612753861.
The spelling of 2421550053 in words is "two billion, four hundred twenty-one million, five hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •