Base | Representation |
---|---|
bin | 10010110101011100… |
… | …00101001100011101 |
3 | 222002201102222202201 |
4 | 21122232011030131 |
5 | 131202130321213 |
6 | 4351222251501 |
7 | 505404163261 |
oct | 113256051435 |
9 | 28081388681 |
10 | 10111963933 |
11 | 4319a38195 |
12 | 1b62586b91 |
13 | c51c5c716 |
14 | 6bcd8a0a1 |
15 | 3e2b276dd |
hex | 25ab8531d |
10111963933 has 2 divisors, whose sum is σ = 10111963934. Its totient is φ = 10111963932.
The previous prime is 10111963907. The next prime is 10111963949. The reversal of 10111963933 is 33936911101.
10111963933 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 can be written as a sum of positive squares in only one way, i.e., 7582578084 + 2529385849 = 87078^2 + 50293^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111963933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111963892 and 10111963901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111963963) 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, 5055981966 + 5055981967.
It is an arithmetic number, because the mean of its divisors is an integer number (5055981967).
Almost surely, 210111963933 is an apocalyptic number.
It is an amenable number.
10111963933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111963933 is an equidigital number, since it uses as much as digits as its factorization.
10111963933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 37.
The spelling of 10111963933 in words is "ten billion, one hundred eleven million, nine hundred sixty-three thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •