Base | Representation |
---|---|
bin | 1100110100101111100100… |
… | …10001110011000011000111 |
3 | 10200211221111002002220021210 |
4 | 12122113302101303003013 |
5 | 12144014133403100210 |
6 | 135551050425542503 |
7 | 5640264204603261 |
oct | 632276221630307 |
9 | 120757432086253 |
10 | 28200525050055 |
11 | 8a92859228336 |
12 | 31b554a944a33 |
13 | 12973b4c10067 |
14 | 6d6cac614b31 |
15 | 33d8613d5e20 |
hex | 19a5f24730c7 |
28200525050055 has 16 divisors (see below), whose sum is σ = 47082615736320. Its totient is φ = 14386354807968.
The previous prime is 28200525050029. The next prime is 28200525050057. The reversal of 28200525050055 is 55005052500282.
It is not a de Polignac number, because 28200525050055 - 25 = 28200525050023 is a prime.
It is a super-2 number, since 2×282005250500552 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28200525049995 and 28200525050022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28200525050057) 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 in 15 ways as a sum of consecutive naturals, for example, 40870325815 + ... + 40870326504.
It is an arithmetic number, because the mean of its divisors is an integer number (2942663483520).
Almost surely, 228200525050055 is an apocalyptic number.
28200525050055 is a deficient number, since it is larger than the sum of its proper divisors (18882090686265).
28200525050055 is a wasteful number, since it uses less digits than its factorization.
28200525050055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81740652350.
The product of its (nonzero) digits is 200000, while the sum is 39.
The spelling of 28200525050055 in words is "twenty-eight trillion, two hundred billion, five hundred twenty-five million, fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •