Base | Representation |
---|---|
bin | 111101000111001… |
… | …010110000101010 |
3 | 2122110021002110020 |
4 | 331013022300222 |
5 | 4044433224013 |
6 | 245423301310 |
7 | 34256546340 |
oct | 7507126052 |
9 | 2573232406 |
10 | 1025289258 |
11 | 486826aa4 |
12 | 24744a836 |
13 | 134552c46 |
14 | 9a251990 |
15 | 60029623 |
hex | 3d1cac2a |
1025289258 has 64 divisors (see below), whose sum is σ = 2437205760. Its totient is φ = 281336832.
The previous prime is 1025289233. The next prime is 1025289259. The reversal of 1025289258 is 8529825201.
1025289258 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (1025289259) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 237810 + ... + 242082.
It is an arithmetic number, because the mean of its divisors is an integer number (38081340).
Almost surely, 21025289258 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1025289258, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1218602880).
1025289258 is an abundant number, since it is smaller than the sum of its proper divisors (1411916502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025289258 is a wasteful number, since it uses less digits than its factorization.
1025289258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4511.
The product of its (nonzero) digits is 115200, while the sum is 42.
The square root of 1025289258 is about 32020.1383195014. The cubic root of 1025289258 is about 1008.3596737847.
The spelling of 1025289258 in words is "one billion, twenty-five million, two hundred eighty-nine thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •