Base | Representation |
---|---|
bin | 1011011001001101100000… |
… | …01011011101001001001111 |
3 | 10021201021121212200022012201 |
4 | 11230212300023131021033 |
5 | 11241002131001434133 |
6 | 125142200544542331 |
7 | 5164125435166213 |
oct | 554466013351117 |
9 | 107637555608181 |
10 | 25055500030543 |
11 | 7a8aa83631a34 |
12 | 2987b103219a7 |
13 | 10c995373c558 |
14 | 62899a998943 |
15 | 2d6b3ec25d7d |
hex | 16c9b02dd24f |
25055500030543 has 2 divisors, whose sum is σ = 25055500030544. Its totient is φ = 25055500030542.
The previous prime is 25055500030453. The next prime is 25055500030573. The reversal of 25055500030543 is 34503000555052.
Together with previous prime (25055500030453) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25055500030543 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25055500030573) 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, 12527750015271 + 12527750015272.
It is an arithmetic number, because the mean of its divisors is an integer number (12527750015272).
Almost surely, 225055500030543 is an apocalyptic number.
25055500030543 is a deficient number, since it is larger than the sum of its proper divisors (1).
25055500030543 is an equidigital number, since it uses as much as digits as its factorization.
25055500030543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225000, while the sum is 37.
Adding to 25055500030543 its reverse (34503000555052), we get a palindrome (59558500585595).
The spelling of 25055500030543 in words is "twenty-five trillion, fifty-five billion, five hundred million, thirty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •