Base | Representation |
---|---|
bin | 1011011110001011100010… |
… | …01110101110001100100001 |
3 | 10022022121100012222020101211 |
4 | 11233011301032232030201 |
5 | 11301301321102122144 |
6 | 125352435331030121 |
7 | 5212351544203651 |
oct | 557056116561441 |
9 | 108277305866354 |
10 | 25226242614049 |
11 | 8046431344084 |
12 | 29b502173b341 |
13 | 110ca94495459 |
14 | 632d570d2361 |
15 | 2db2d4856034 |
hex | 16f1713ae321 |
25226242614049 has 2 divisors, whose sum is σ = 25226242614050. Its totient is φ = 25226242614048.
The previous prime is 25226242614031. The next prime is 25226242614071. The reversal of 25226242614049 is 94041624262252.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21018492975649 + 4207749638400 = 4584593^2 + 2051280^2 .
It is a cyclic number.
It is not a de Polignac number, because 25226242614049 - 213 = 25226242605857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25226242613993 and 25226242614011.
It is not a weakly prime, because it can be changed into another prime (25226242614019) 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, 12613121307024 + 12613121307025.
It is an arithmetic number, because the mean of its divisors is an integer number (12613121307025).
Almost surely, 225226242614049 is an apocalyptic number.
It is an amenable number.
25226242614049 is a deficient number, since it is larger than the sum of its proper divisors (1).
25226242614049 is an equidigital number, since it uses as much as digits as its factorization.
25226242614049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3317760, while the sum is 49.
The spelling of 25226242614049 in words is "twenty-five trillion, two hundred twenty-six billion, two hundred forty-two million, six hundred fourteen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •