Base | Representation |
---|---|
bin | 1011010111100110101001… |
… | …00010110011001011100001 |
3 | 10021112000002012002021112012 |
4 | 11223303110202303023201 |
5 | 11234101031020230131 |
6 | 125100545032442305 |
7 | 5160132063662363 |
oct | 553632442631341 |
9 | 107460065067465 |
10 | 25000275555041 |
11 | 7a69614882136 |
12 | 2979279849395 |
13 | 10c4692497407 |
14 | 62603c452d33 |
15 | 2d54ab88852b |
hex | 16bcd48b32e1 |
25000275555041 has 2 divisors, whose sum is σ = 25000275555042. Its totient is φ = 25000275555040.
The previous prime is 25000275555019. The next prime is 25000275555053. The reversal of 25000275555041 is 14055557200052.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23217903702016 + 1782371853025 = 4818496^2 + 1335055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25000275555041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 25000275555041.
It is not a weakly prime, because it can be changed into another prime (25000275555341) 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, 12500137777520 + 12500137777521.
It is an arithmetic number, because the mean of its divisors is an integer number (12500137777521).
Almost surely, 225000275555041 is an apocalyptic number.
It is an amenable number.
25000275555041 is a deficient number, since it is larger than the sum of its proper divisors (1).
25000275555041 is an equidigital number, since it uses as much as digits as its factorization.
25000275555041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 350000, while the sum is 41.
The spelling of 25000275555041 in words is "twenty-five trillion, two hundred seventy-five million, five hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •