Base | Representation |
---|---|
bin | 10011111010110011… |
… | …10100110100010011 |
3 | 1000121021101012100102 |
4 | 21331121310310103 |
5 | 133400111402111 |
6 | 4525050243015 |
7 | 526001165201 |
oct | 117531646423 |
9 | 30537335312 |
10 | 10693856531 |
11 | 4598448766 |
12 | 20a542646b |
13 | 1015688477 |
14 | 73637c071 |
15 | 428c6a13b |
hex | 27d674d13 |
10693856531 has 2 divisors, whose sum is σ = 10693856532. Its totient is φ = 10693856530.
The previous prime is 10693856521. The next prime is 10693856573. The reversal of 10693856531 is 13565839601.
It is a weak prime.
It is an emirp because it is prime and its reverse (13565839601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10693856531 - 226 = 10626747667 is a prime.
It is a super-2 number, since 2×106938565312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10693856521) 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 as a sum of consecutive naturals, namely, 5346928265 + 5346928266.
It is an arithmetic number, because the mean of its divisors is an integer number (5346928266).
Almost surely, 210693856531 is an apocalyptic number.
10693856531 is a deficient number, since it is larger than the sum of its proper divisors (1).
10693856531 is an equidigital number, since it uses as much as digits as its factorization.
10693856531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 47.
The spelling of 10693856531 in words is "ten billion, six hundred ninety-three million, eight hundred fifty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •