Base | Representation |
---|---|
bin | 10111101101011001… |
… | …01010001110111101 |
3 | 1012212002112220211101 |
4 | 23312230222032331 |
5 | 202032040241203 |
6 | 5503023053101 |
7 | 630301221052 |
oct | 136654521675 |
9 | 35762486741 |
10 | 12728837053 |
11 | 5442107749 |
12 | 2572a41191 |
13 | 127b15c75a |
14 | 88a741029 |
15 | 4e773c41d |
hex | 2f6b2a3bd |
12728837053 has 4 divisors (see below), whose sum is σ = 12729816220. Its totient is φ = 12727857888.
The previous prime is 12728837021. The next prime is 12728837071. The reversal of 12728837053 is 35073882721.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35073882721 = 79 ⋅443973199.
It can be written as a sum of positive squares in 2 ways, for example, as 6723672004 + 6005165049 = 81998^2 + 77493^2 .
It is a cyclic number.
It is not a de Polignac number, because 12728837053 - 25 = 12728837021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12728836994 and 12728837012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12728837153) 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, 469818 + ... + 496171.
It is an arithmetic number, because the mean of its divisors is an integer number (3182454055).
Almost surely, 212728837053 is an apocalyptic number.
It is an amenable number.
12728837053 is a deficient number, since it is larger than the sum of its proper divisors (979167).
12728837053 is an equidigital number, since it uses as much as digits as its factorization.
12728837053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979166.
The product of its (nonzero) digits is 564480, while the sum is 46.
The spelling of 12728837053 in words is "twelve billion, seven hundred twenty-eight million, eight hundred thirty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •