Base | Representation |
---|---|
bin | 111101000110010… |
… | …000111001100100 |
3 | 2122102211001100112 |
4 | 331012100321210 |
5 | 4044403133020 |
6 | 245414232152 |
7 | 34254541361 |
oct | 7506207144 |
9 | 2572731315 |
10 | 1025052260 |
11 | 486684a31 |
12 | 247355658 |
13 | 13449c0cb |
14 | 9a1cd468 |
15 | 5eece2c5 |
hex | 3d190e64 |
1025052260 has 12 divisors (see below), whose sum is σ = 2152609788. Its totient is φ = 410020896.
The previous prime is 1025052257. The next prime is 1025052283. The reversal of 1025052260 is 622505201.
It can be written as a sum of positive squares in 2 ways, for example, as 752075776 + 272976484 = 27424^2 + 16522^2 .
It is a super-2 number, since 2×10250522602 = 2101464271462215200, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25626287 + ... + 25626326.
It is an arithmetic number, because the mean of its divisors is an integer number (179384149).
Almost surely, 21025052260 is an apocalyptic number.
1025052260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1025052260 is an abundant number, since it is smaller than the sum of its proper divisors (1127557528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025052260 is a wasteful number, since it uses less digits than its factorization.
1025052260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51252622 (or 51252620 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1025052260 is about 32016.4373408410. The cubic root of 1025052260 is about 1008.2819729017.
Adding to 1025052260 its reverse (622505201), we get a palindrome (1647557461).
The spelling of 1025052260 in words is "one billion, twenty-five million, fifty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •