Base | Representation |
---|---|
bin | 10011100110100100… |
… | …10100000011000100 |
3 | 1000011102222102221020 |
4 | 21303102110003010 |
5 | 133023133141030 |
6 | 4500144151140 |
7 | 521540334300 |
oct | 116322240304 |
9 | 30142872836 |
10 | 10524115140 |
11 | 4510652520 |
12 | 20586084b0 |
13 | cb9466a86 |
14 | 71b9d4d00 |
15 | 418ddb510 |
hex | 2734940c4 |
10524115140 has 144 divisors (see below), whose sum is σ = 37394892864. Its totient is φ = 2186822400.
The previous prime is 10524115111. The next prime is 10524115157. The reversal of 10524115140 is 4151142501.
It is a super-2 number, since 2×105241151402 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10524115140.
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 47 ways as a sum of consecutive naturals, for example, 130371 + ... + 195050.
It is an arithmetic number, because the mean of its divisors is an integer number (259686756).
Almost surely, 210524115140 is an apocalyptic number.
10524115140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10524115140 is an abundant number, since it is smaller than the sum of its proper divisors (26870777724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10524115140 is a wasteful number, since it uses less digits than its factorization.
10524115140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325458 (or 325449 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 10524115140 its reverse (4151142501), we get a palindrome (14675257641).
The spelling of 10524115140 in words is "ten billion, five hundred twenty-four million, one hundred fifteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •