Base | Representation |
---|---|
bin | 10011101000010011… |
… | …01000011110100111 |
3 | 1000012110021012101122 |
4 | 21310021220132213 |
5 | 133040341213433 |
6 | 4501423044155 |
7 | 522104523104 |
oct | 116411503647 |
9 | 30173235348 |
10 | 10538616743 |
11 | 4518857816 |
12 | 206144065b |
13 | cbc4735c5 |
14 | 71d8cbaab |
15 | 41a303198 |
hex | 2742687a7 |
10538616743 has 2 divisors, whose sum is σ = 10538616744. Its totient is φ = 10538616742.
The previous prime is 10538616731. The next prime is 10538616839. The reversal of 10538616743 is 34761683501.
10538616743 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10538616743 - 216 = 10538551207 is a prime.
It is a super-3 number, since 3×105386167433 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10538616694 and 10538616703.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10538696743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5269308371 + 5269308372.
It is an arithmetic number, because the mean of its divisors is an integer number (5269308372).
Almost surely, 210538616743 is an apocalyptic number.
10538616743 is a deficient number, since it is larger than the sum of its proper divisors (1).
10538616743 is an equidigital number, since it uses as much as digits as its factorization.
10538616743 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 10538616743 in words is "ten billion, five hundred thirty-eight million, six hundred sixteen thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •