Base | Representation |
---|---|
bin | 10011100100010010… |
… | …00010000010100111 |
3 | 1000010002211110101210 |
4 | 21302021002002213 |
5 | 133003223423441 |
6 | 4454220322503 |
7 | 521215134546 |
oct | 116211020247 |
9 | 30102743353 |
10 | 10504904871 |
11 | 450082156a |
12 | 20520a3433 |
13 | cb549bc56 |
14 | 71923415d |
15 | 417394616 |
hex | 2722420a7 |
10504904871 has 16 divisors (see below), whose sum is σ = 14652338400. Its totient is φ = 6685797888.
The previous prime is 10504904827. The next prime is 10504904947. The reversal of 10504904871 is 17840940501.
It is not a de Polignac number, because 10504904871 - 213 = 10504896679 is a prime.
It is a super-2 number, since 2×105049048712 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10504904671) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 670606 + ... + 686091.
It is an arithmetic number, because the mean of its divisors is an integer number (915771150).
Almost surely, 210504904871 is an apocalyptic number.
10504904871 is a deficient number, since it is larger than the sum of its proper divisors (4147433529).
10504904871 is a wasteful number, since it uses less digits than its factorization.
10504904871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356818.
The product of its (nonzero) digits is 40320, while the sum is 39.
The spelling of 10504904871 in words is "ten billion, five hundred four million, nine hundred four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •