Base | Representation |
---|---|
bin | 10011100100101111… |
… | …00011000100000000 |
3 | 1000010100222210020211 |
4 | 21302113203010000 |
5 | 133010212211034 |
6 | 4454434043504 |
7 | 521262363622 |
oct | 116227430400 |
9 | 30110883224 |
10 | 10508710144 |
11 | 4502990519 |
12 | 2053419594 |
13 | cb6201caa |
14 | 719944c12 |
15 | 417896d64 |
hex | 2725e3100 |
10508710144 has 81 divisors (see below), whose sum is σ = 21620636373. Its totient is φ = 5097716736.
The previous prime is 10508710127. The next prime is 10508710151. The reversal of 10508710144 is 44101780501.
The square root of 10508710144 is 102512.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1231167744 + 9277542400 = 35088^2 + 96320^2 .
It is a super-2 number, since 2×105087101442 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 70528182 + ... + 70528330.
Almost surely, 210508710144 is an apocalyptic number.
10508710144 is the 102512-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10508710144
10508710144 is an abundant number, since it is smaller than the sum of its proper divisors (11111926229).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10508710144 is an frugal number, since it uses more digits than its factorization.
10508710144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400 (or 194 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 31.
The spelling of 10508710144 in words is "ten billion, five hundred eight million, seven hundred ten thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •