Base | Representation |
---|---|
bin | 11101110101011010110… |
… | …00100110001001000101 |
3 | 10121222222202102121201011 |
4 | 32322231120212021011 |
5 | 113243411421410001 |
6 | 2102532441002221 |
7 | 134030131525504 |
oct | 16725530461105 |
9 | 3558882377634 |
10 | 1025111122501 |
11 | 36582455a9a4 |
12 | 14680b783371 |
13 | 7588a83b2cb |
14 | 3788947883b |
15 | 1b9eb088d51 |
hex | eead626245 |
1025111122501 has 2 divisors, whose sum is σ = 1025111122502. Its totient is φ = 1025111122500.
The previous prime is 1025111122493. The next prime is 1025111122507. The reversal of 1025111122501 is 1052211115201.
It is a happy number.
1025111122501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 917622221476 + 107488901025 = 957926^2 + 327855^2 .
It is a cyclic number.
It is not a de Polignac number, because 1025111122501 - 23 = 1025111122493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1025111122507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512555561250 + 512555561251.
It is an arithmetic number, because the mean of its divisors is an integer number (512555561251).
Almost surely, 21025111122501 is an apocalyptic number.
It is an amenable number.
1025111122501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025111122501 is an equidigital number, since it uses as much as digits as its factorization.
1025111122501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 200, while the sum is 22.
Adding to 1025111122501 its reverse (1052211115201), we get a palindrome (2077322237702).
The spelling of 1025111122501 in words is "one trillion, twenty-five billion, one hundred eleven million, one hundred twenty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •