Base | Representation |
---|---|
bin | 10100001110111110… |
… | …10010000010100111 |
3 | 1001001001202120122122 |
4 | 22013133102002213 |
5 | 134221420342421 |
6 | 4553533020155 |
7 | 533124323162 |
oct | 120737220247 |
9 | 31031676578 |
10 | 10863059111 |
11 | 4674a06103 |
12 | 213202465b |
13 | 104174b838 |
14 | 750a24ad9 |
15 | 438a3e2ab |
hex | 2877d20a7 |
10863059111 has 2 divisors, whose sum is σ = 10863059112. Its totient is φ = 10863059110.
The previous prime is 10863059089. The next prime is 10863059131. The reversal of 10863059111 is 11195036801.
It is a happy number.
10863059111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10863059111 - 214 = 10863042727 is a prime.
It is a super-2 number, since 2×108630591112 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10863059131) 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, 5431529555 + 5431529556.
It is an arithmetic number, because the mean of its divisors is an integer number (5431529556).
Almost surely, 210863059111 is an apocalyptic number.
10863059111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10863059111 is an equidigital number, since it uses as much as digits as its factorization.
10863059111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 35.
Subtracting from 10863059111 its sum of digits (35), we obtain a square (10863059076 = 1042262).
The spelling of 10863059111 in words is "ten billion, eight hundred sixty-three million, fifty-nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •