Base | Representation |
---|---|
bin | 11101110101101010010… |
… | …01101010000011101111 |
3 | 10122000022211121121220201 |
4 | 32322311021222003233 |
5 | 113244143301032421 |
6 | 2102553413454331 |
7 | 134033303213542 |
oct | 16726511520357 |
9 | 3560284547821 |
10 | 1025241424111 |
11 | 365891068483 |
12 | 1468473413a7 |
13 | 758ab831158 |
14 | 3789c8b6859 |
15 | 1ba07726b91 |
hex | eeb526a0ef |
1025241424111 has 2 divisors, whose sum is σ = 1025241424112. Its totient is φ = 1025241424110.
The previous prime is 1025241424079. The next prime is 1025241424127. The reversal of 1025241424111 is 1114241425201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1025241424111 - 25 = 1025241424079 is a prime.
It is a super-2 number, since 2×10252414241112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1025241424111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1025241424811) 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, 512620712055 + 512620712056.
It is an arithmetic number, because the mean of its divisors is an integer number (512620712056).
Almost surely, 21025241424111 is an apocalyptic number.
1025241424111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025241424111 is an equidigital number, since it uses as much as digits as its factorization.
1025241424111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2560, while the sum is 28.
Adding to 1025241424111 its reverse (1114241425201), we get a palindrome (2139482849312).
The spelling of 1025241424111 in words is "one trillion, twenty-five billion, two hundred forty-one million, four hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •