Base | Representation |
---|---|
bin | 111101001000001… |
… | …100011011111100 |
3 | 2122110202202110120 |
4 | 331020030123330 |
5 | 4100020331033 |
6 | 245433134540 |
7 | 34262046540 |
oct | 7510143374 |
9 | 2573682416 |
10 | 1025558268 |
11 | 4869a0119 |
12 | 24755a450 |
13 | 134618517 |
14 | 9a2c1a20 |
15 | 6007e1b3 |
hex | 3d20c6fc |
1025558268 has 96 divisors (see below), whose sum is σ = 2801627136. Its totient is φ = 285921792.
The previous prime is 1025558257. The next prime is 1025558311. The reversal of 1025558268 is 8628555201.
It is a super-2 number, since 2×10255582682 = 2103539522126319648, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 992280 + ... + 993312.
It is an arithmetic number, because the mean of its divisors is an integer number (29183616).
Almost surely, 21025558268 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1025558268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1400813568).
1025558268 is an abundant number, since it is smaller than the sum of its proper divisors (1776068868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025558268 is a wasteful number, since it uses less digits than its factorization.
1025558268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1323 (or 1321 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 42.
The square root of 1025558268 is about 32024.3386816965. The cubic root of 1025558268 is about 1008.4478554412.
The spelling of 1025558268 in words is "one billion, twenty-five million, five hundred fifty-eight thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •