Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10110000000010001 |
3 | 1001110000111201111121 |
4 | 22100312312000101 |
5 | 140032134340143 |
6 | 5021305442241 |
7 | 540043262254 |
oct | 122066660021 |
9 | 31400451447 |
10 | 11020230673 |
11 | 47456a6461 |
12 | 21767a0381 |
13 | 106818ba6a |
14 | 76785909b |
15 | 4477387ed |
hex | 290db6011 |
11020230673 has 2 divisors, whose sum is σ = 11020230674. Its totient is φ = 11020230672.
The previous prime is 11020230667. The next prime is 11020230691. The reversal of 11020230673 is 37603202011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7893967104 + 3126263569 = 88848^2 + 55913^2 .
It is an emirp because it is prime and its reverse (37603202011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11020230673 - 221 = 11018133521 is a prime.
It is a super-2 number, since 2×110202306732 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11020230623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510115336 + 5510115337.
It is an arithmetic number, because the mean of its divisors is an integer number (5510115337).
Almost surely, 211020230673 is an apocalyptic number.
It is an amenable number.
11020230673 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020230673 is an equidigital number, since it uses as much as digits as its factorization.
11020230673 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 11020230673 its reverse (37603202011), we get a palindrome (48623432684).
The spelling of 11020230673 in words is "eleven billion, twenty million, two hundred thirty thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •