Base | Representation |
---|---|
bin | 1011100111101011111000… |
… | …11111011000111101110001 |
3 | 10100110211100222121010020201 |
4 | 11303311330133120331301 |
5 | 11322124213324004114 |
6 | 130202452232235201 |
7 | 5245063264114015 |
oct | 563657437307561 |
9 | 110424328533221 |
10 | 25552849047409 |
11 | 81619a2142582 |
12 | 2a4839153bb01 |
13 | 11348145a6648 |
14 | 644a9baa8545 |
15 | 2e4a4cc57874 |
hex | 173d7c7d8f71 |
25552849047409 has 2 divisors, whose sum is σ = 25552849047410. Its totient is φ = 25552849047408.
The previous prime is 25552849047403. The next prime is 25552849047421. The reversal of 25552849047409 is 90474094825552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24919914240225 + 632934807184 = 4991985^2 + 795572^2 .
It is a cyclic number.
It is not a de Polignac number, because 25552849047409 - 27 = 25552849047281 is a prime.
It is a super-2 number, since 2×255528490474092 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (25552849047403) 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, 12776424523704 + 12776424523705.
It is an arithmetic number, because the mean of its divisors is an integer number (12776424523705).
Almost surely, 225552849047409 is an apocalyptic number.
It is an amenable number.
25552849047409 is a deficient number, since it is larger than the sum of its proper divisors (1).
25552849047409 is an equidigital number, since it uses as much as digits as its factorization.
25552849047409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152000, while the sum is 64.
The spelling of 25552849047409 in words is "twenty-five trillion, five hundred fifty-two billion, eight hundred forty-nine million, forty-seven thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •