Base | Representation |
---|---|
bin | 1001001100100110001011… |
… | …0001010100100011000001 |
3 | 1022210200212101000110100021 |
4 | 2103021202301110203001 |
5 | 2311133344042024134 |
6 | 33301220542253441 |
7 | 2062366015521211 |
oct | 223114261244301 |
9 | 38720771013307 |
10 | 10112010111169 |
11 | 32495300a742a |
12 | 1173937887281 |
13 | 584734c2cb05 |
14 | 26d5d1280241 |
15 | 1280837490b4 |
hex | 93262c548c1 |
10112010111169 has 2 divisors, whose sum is σ = 10112010111170. Its totient is φ = 10112010111168.
The previous prime is 10112010111113. The next prime is 10112010111239. The reversal of 10112010111169 is 96111101021101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6501964511025 + 3610045600144 = 2549895^2 + 1900012^2 .
It is a cyclic number.
It is not a de Polignac number, because 10112010111169 - 211 = 10112010109121 is a prime.
It is a super-2 number, since 2×101120101111692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10112010111869) 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, 5056005055584 + 5056005055585.
It is an arithmetic number, because the mean of its divisors is an integer number (5056005055585).
Almost surely, 210112010111169 is an apocalyptic number.
It is an amenable number.
10112010111169 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112010111169 is an equidigital number, since it uses as much as digits as its factorization.
10112010111169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 25.
The spelling of 10112010111169 in words is "ten trillion, one hundred twelve billion, ten million, one hundred eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •