Base | Representation |
---|---|
bin | 1011011110111011101110… |
… | …10011001001011101111001 |
3 | 10022102002010021000002011021 |
4 | 11233131313103021131321 |
5 | 11302212312221211101 |
6 | 125412354445502441 |
7 | 5214255634333645 |
oct | 557356723113571 |
9 | 108362107002137 |
10 | 25252114241401 |
11 | 80563a8193693 |
12 | 29ba041b71a21 |
13 | 111235846cca8 |
14 | 6342cd12bc25 |
15 | 2dbceaced5a1 |
hex | 16f7774c9779 |
25252114241401 has 2 divisors, whose sum is σ = 25252114241402. Its totient is φ = 25252114241400.
The previous prime is 25252114241297. The next prime is 25252114241467. The reversal of 25252114241401 is 10414241125252.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21107730319225 + 4144383922176 = 4594315^2 + 2035776^2 .
It is a cyclic number.
It is not a de Polignac number, because 25252114241401 - 213 = 25252114233209 is a prime.
It is not a weakly prime, because it can be changed into another prime (25252114245401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12626057120700 + 12626057120701.
It is an arithmetic number, because the mean of its divisors is an integer number (12626057120701).
Almost surely, 225252114241401 is an apocalyptic number.
It is an amenable number.
25252114241401 is a deficient number, since it is larger than the sum of its proper divisors (1).
25252114241401 is an equidigital number, since it uses as much as digits as its factorization.
25252114241401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25600, while the sum is 34.
Adding to 25252114241401 its reverse (10414241125252), we get a palindrome (35666355366653).
The spelling of 25252114241401 in words is "twenty-five trillion, two hundred fifty-two billion, one hundred fourteen million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •