Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0001100011100010000101 |
3 | 1022210111200100201011101202 |
4 | 2103013223001203202011 |
5 | 2311120240240212213 |
6 | 33300245334232245 |
7 | 2062265152311416 |
oct | 223075301434205 |
9 | 38714610634352 |
10 | 10110001100933 |
11 | 324869a066298 |
12 | 1173476ab5685 |
13 | 5844a494c566 |
14 | 26d48051b80d |
15 | 127eb71a6b58 |
hex | 931eb063885 |
10110001100933 has 2 divisors, whose sum is σ = 10110001100934. Its totient is φ = 10110001100932.
The previous prime is 10110001100929. The next prime is 10110001101017. The reversal of 10110001100933 is 33900110001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8991350079364 + 1118651021569 = 2998558^2 + 1057663^2 .
It is an emirp because it is prime and its reverse (33900110001101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110001100933 - 22 = 10110001100929 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110001100533) 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, 5055000550466 + 5055000550467.
It is an arithmetic number, because the mean of its divisors is an integer number (5055000550467).
Almost surely, 210110001100933 is an apocalyptic number.
It is an amenable number.
10110001100933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110001100933 is an equidigital number, since it uses as much as digits as its factorization.
10110001100933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
The spelling of 10110001100933 in words is "ten trillion, one hundred ten billion, one million, one hundred thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •