Base | Representation |
---|---|
bin | 10100001111111110… |
… | …00001100000111111 |
3 | 1001001122102022210212 |
4 | 22013333001200333 |
5 | 134231033130111 |
6 | 4554431223035 |
7 | 533255130341 |
oct | 120777014077 |
9 | 31048368725 |
10 | 10871380031 |
11 | 46796797a6 |
12 | 2134977a7b |
13 | 10433a3065 |
14 | 751b8d291 |
15 | 43963498b |
hex | 287fc183f |
10871380031 has 24 divisors (see below), whose sum is σ = 12094181280. Its totient is φ = 9719975936.
The previous prime is 10871380027. The next prime is 10871380033. The reversal of 10871380031 is 13008317801.
It is not a de Polignac number, because 10871380031 - 22 = 10871380027 is a prime.
It is a super-2 number, since 2×108713800312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10871380031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10871380033) 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, 11701775 + ... + 11702703.
It is an arithmetic number, because the mean of its divisors is an integer number (503924220).
Almost surely, 210871380031 is an apocalyptic number.
10871380031 is a deficient number, since it is larger than the sum of its proper divisors (1222801249).
10871380031 is an equidigital number, since it uses as much as digits as its factorization.
10871380031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315 (or 1142 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 32.
Adding to 10871380031 its reverse (13008317801), we get a palindrome (23879697832).
The spelling of 10871380031 in words is "ten billion, eight hundred seventy-one million, three hundred eighty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •