Base | Representation |
---|---|
bin | 10111111001001111… |
… | …10001011011111101 |
3 | 1020010000120001102011 |
4 | 23330213301123331 |
5 | 202233011003013 |
6 | 5520533131221 |
7 | 632616030532 |
oct | 137447613375 |
9 | 36100501364 |
10 | 12828219133 |
11 | 54932169a4 |
12 | 25a0189b11 |
13 | 1295917c12 |
14 | 899a10d89 |
15 | 50131dc3d |
hex | 2fc9f16fd |
12828219133 has 2 divisors, whose sum is σ = 12828219134. Its totient is φ = 12828219132.
The previous prime is 12828219121. The next prime is 12828219149. The reversal of 12828219133 is 33191282821.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12818315524 + 9903609 = 113218^2 + 3147^2 .
It is an emirp because it is prime and its reverse (33191282821) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12828219133 - 25 = 12828219101 is a prime.
It is a super-3 number, since 3×128282191333 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12828279133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6414109566 + 6414109567.
It is an arithmetic number, because the mean of its divisors is an integer number (6414109567).
Almost surely, 212828219133 is an apocalyptic number.
It is an amenable number.
12828219133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12828219133 is an equidigital number, since it uses as much as digits as its factorization.
12828219133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 40.
The spelling of 12828219133 in words is "twelve billion, eight hundred twenty-eight million, two hundred nineteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •