Base | Representation |
---|---|
bin | 10011100101011111… |
… | …11110010010100100 |
3 | 1000010211001002111020 |
4 | 21302233332102210 |
5 | 133013332104444 |
6 | 4455223211140 |
7 | 521400662325 |
oct | 116257762244 |
9 | 30124032436 |
10 | 10515113124 |
11 | 450656413a |
12 | 20555a6ab0 |
13 | cb7634539 |
14 | 71a73044c |
15 | 41820e119 |
hex | 272bfe4a4 |
10515113124 has 12 divisors (see below), whose sum is σ = 24535263984. Its totient is φ = 3505037704.
The previous prime is 10515113111. The next prime is 10515113143. The reversal of 10515113124 is 42131151501.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×105151131242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10515113094 and 10515113103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 438129702 + ... + 438129725.
It is an arithmetic number, because the mean of its divisors is an integer number (2044605332).
Almost surely, 210515113124 is an apocalyptic number.
It is an amenable number.
10515113124 is an abundant number, since it is smaller than the sum of its proper divisors (14020150860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10515113124 is a wasteful number, since it uses less digits than its factorization.
10515113124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876259434 (or 876259432 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 10515113124 its reverse (42131151501), we get a palindrome (52646264625).
The spelling of 10515113124 in words is "ten billion, five hundred fifteen million, one hundred thirteen thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •