Base | Representation |
---|---|
bin | 111101000111000… |
… | …001011011111101 |
3 | 2122110012011001211 |
4 | 331013001123331 |
5 | 4044431013234 |
6 | 245422404421 |
7 | 34256330113 |
oct | 7507013375 |
9 | 2573164054 |
10 | 1025251069 |
11 | 486800337 |
12 | 247430711 |
13 | 13453b74b |
14 | 9a241ab3 |
15 | 6001d164 |
hex | 3d1c16fd |
1025251069 has 2 divisors, whose sum is σ = 1025251070. Its totient is φ = 1025251068.
The previous prime is 1025251063. The next prime is 1025251187. The reversal of 1025251069 is 9601525201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 808719844 + 216531225 = 28438^2 + 14715^2 .
It is an emirp because it is prime and its reverse (9601525201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1025251069 - 25 = 1025251037 is a prime.
It is a super-2 number, since 2×10252510692 = 2102279508971285522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1025251069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1025251063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512625534 + 512625535.
It is an arithmetic number, because the mean of its divisors is an integer number (512625535).
Almost surely, 21025251069 is an apocalyptic number.
It is an amenable number.
1025251069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025251069 is an equidigital number, since it uses as much as digits as its factorization.
1025251069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 1025251069 is about 32019.5419861059. The cubic root of 1025251069 is about 1008.3471541549.
The spelling of 1025251069 in words is "one billion, twenty-five million, two hundred fifty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •