Base | Representation |
---|---|
bin | 10111001000101000… |
… | …10010111000010101 |
3 | 1012001121021202010000 |
4 | 23210110102320111 |
5 | 200414114210203 |
6 | 5412245321513 |
7 | 616535111541 |
oct | 134424227025 |
9 | 35047252100 |
10 | 12420460053 |
11 | 52a4031521 |
12 | 24a7706299 |
13 | 122c2baa61 |
14 | 85b7caa21 |
15 | 4ca6264a3 |
hex | 2e4512e15 |
12420460053 has 20 divisors (see below), whose sum is σ = 18613336588. Its totient is φ = 8253835200.
The previous prime is 12420459973. The next prime is 12420460079. The reversal of 12420460053 is 35006402421.
12420460053 is a `hidden beast` number, since 1 + 2 + 4 + 2 + 0 + 4 + 600 + 53 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 82137969 + 12338322084 = 9063^2 + 111078^2 .
It is not a de Polignac number, because 12420460053 - 216 = 12420394517 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12420459999 and 12420460026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12420460453) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 219598 + ... + 270303.
Almost surely, 212420460053 is an apocalyptic number.
It is an amenable number.
12420460053 is a deficient number, since it is larger than the sum of its proper divisors (6192876535).
12420460053 is an equidigital number, since it uses as much as digits as its factorization.
12420460053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490226 (or 490217 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 12420460053 its reverse (35006402421), we get a palindrome (47426862474).
The spelling of 12420460053 in words is "twelve billion, four hundred twenty million, four hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •