Base | Representation |
---|---|
bin | 10011100101001011… |
… | …10010111001100111 |
3 | 1000010122000112112222 |
4 | 21302211302321213 |
5 | 133012141220111 |
6 | 4455050102555 |
7 | 521336210534 |
oct | 116245627147 |
9 | 30118015488 |
10 | 10512445031 |
11 | 4505001600 |
12 | 205471aa5b |
13 | cb6c0bc9a |
14 | 71a237d8b |
15 | 417d837db |
hex | 272972e67 |
10512445031 has 24 divisors (see below), whose sum is σ = 11695966800. Its totient is φ = 9440766720.
The previous prime is 10512444983. The next prime is 10512445037. The reversal of 10512445031 is 13054421501.
It is not a de Polignac number, because 10512445031 - 26 = 10512444967 is a prime.
It is a super-2 number, since 2×105124450312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10512445037) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 4770776 + ... + 4772978.
It is an arithmetic number, because the mean of its divisors is an integer number (487331950).
Almost surely, 210512445031 is an apocalyptic number.
10512445031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10512445031 is a deficient number, since it is larger than the sum of its proper divisors (1183521769).
10512445031 is a wasteful number, since it uses less digits than its factorization.
10512445031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2687 (or 2676 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10512445031 its reverse (13054421501), we get a palindrome (23566866532).
The spelling of 10512445031 in words is "ten billion, five hundred twelve million, four hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •