Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …010011100100011010001 |
3 | 10222002011200210002011201 |
4 | 100103023022130203101 |
5 | 121322431100311233 |
6 | 2214322234311201 |
7 | 143632056665233 |
oct | 20231312344321 |
9 | 3862150702151 |
10 | 1120100010193 |
11 | 3a203928916a |
12 | 1610bb288501 |
13 | 818180cb228 |
14 | 3c2dab84253 |
15 | 1e20a3c477d |
hex | 104cb29c8d1 |
1120100010193 has 2 divisors, whose sum is σ = 1120100010194. Its totient is φ = 1120100010192.
The previous prime is 1120100010191. The next prime is 1120100010251. The reversal of 1120100010193 is 3910100010211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1119220116624 + 879893569 = 1057932^2 + 29663^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120100010193 - 21 = 1120100010191 is a prime.
Together with 1120100010191, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1120100010193.
It is not a weakly prime, because it can be changed into another prime (1120100010191) 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, 560050005096 + 560050005097.
It is an arithmetic number, because the mean of its divisors is an integer number (560050005097).
Almost surely, 21120100010193 is an apocalyptic number.
It is an amenable number.
1120100010193 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120100010193 is an equidigital number, since it uses as much as digits as its factorization.
1120100010193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 1120100010193 in words is "one trillion, one hundred twenty billion, one hundred million, ten thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •