Base | Representation |
---|---|
bin | 10011100100111010… |
… | …11011000000010000 |
3 | 1000010110220000112112 |
4 | 21302131123000100 |
5 | 133011111000000 |
6 | 4454531044452 |
7 | 521311436165 |
oct | 116235330020 |
9 | 30113800475 |
10 | 10510250000 |
11 | 4503842428 |
12 | 2053a40728 |
13 | cb6620b53 |
14 | 719c2606c |
15 | 417a9d235 |
hex | 27275b010 |
10510250000 has 140 divisors (see below), whose sum is σ = 26962389252. Its totient is φ = 3955200000.
The previous prime is 10510249991. The next prime is 10510250011. The reversal of 10510250000 is 5201501.
It can be written as a sum of positive squares in 14 ways, for example, as 10276282384 + 233967616 = 101372^2 + 15296^2 .
It is a super-2 number, since 2×105102500002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 4248764 + ... + 4251236.
Almost surely, 210510250000 is an apocalyptic number.
10510250000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10510250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13481194626).
10510250000 is an abundant number, since it is smaller than the sum of its proper divisors (16452139252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10510250000 is an frugal number, since it uses more digits than its factorization.
10510250000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2528 (or 2497 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
Adding to 10510250000 its reverse (5201501), we get a palindrome (10515451501).
The spelling of 10510250000 in words is "ten billion, five hundred ten million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •