Base | Representation |
---|---|
bin | 1010000010000110011000… |
… | …0011000011100101011001 |
3 | 1110001120102110112222021002 |
4 | 2200201212003003211121 |
5 | 2421213333122441043 |
6 | 35243354032354345 |
7 | 2215656060460055 |
oct | 240414603034531 |
9 | 43046373488232 |
10 | 11031188093273 |
11 | 3573334107007 |
12 | 12a1b026a59b5 |
13 | 62030c9a1c0a |
14 | 2a1cab6d0c65 |
15 | 141e2e76abb8 |
hex | a08660c3959 |
11031188093273 has 2 divisors, whose sum is σ = 11031188093274. Its totient is φ = 11031188093272.
The previous prime is 11031188093243. The next prime is 11031188093347. The reversal of 11031188093273 is 37239088113011.
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., 7058230233289 + 3972957859984 = 2656733^2 + 1993228^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11031188093273 is a prime.
It is a super-2 number, since 2×110311880932732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11031188093243) 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, 5515594046636 + 5515594046637.
It is an arithmetic number, because the mean of its divisors is an integer number (5515594046637).
Almost surely, 211031188093273 is an apocalyptic number.
It is an amenable number.
11031188093273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031188093273 is an equidigital number, since it uses as much as digits as its factorization.
11031188093273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 47.
The spelling of 11031188093273 in words is "eleven trillion, thirty-one billion, one hundred eighty-eight million, ninety-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •