Base | Representation |
---|---|
bin | 10100100001111011… |
… | …01000011011011001 |
3 | 1001110010212010101022 |
4 | 22100331220123121 |
5 | 140033113310243 |
6 | 5021411532225 |
7 | 540064353104 |
oct | 122075503331 |
9 | 31403763338 |
10 | 11022010073 |
11 | 4746701338 |
12 | 21772ba075 |
13 | 1068662969 |
14 | 767b9d73b |
15 | 44798ab68 |
hex | 290f686d9 |
11022010073 has 2 divisors, whose sum is σ = 11022010074. Its totient is φ = 11022010072.
The previous prime is 11022010063. The next prime is 11022010081. The reversal of 11022010073 is 37001022011.
11022010073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11010934489 + 11075584 = 104933^2 + 3328^2 .
It is an emirp because it is prime and its reverse (37001022011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11022010073 - 224 = 11005232857 is a prime.
It is not a weakly prime, because it can be changed into another prime (11022010003) 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, 5511005036 + 5511005037.
It is an arithmetic number, because the mean of its divisors is an integer number (5511005037).
Almost surely, 211022010073 is an apocalyptic number.
It is an amenable number.
11022010073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11022010073 is an equidigital number, since it uses as much as digits as its factorization.
11022010073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
Adding to 11022010073 its reverse (37001022011), we get a palindrome (48023032084).
The spelling of 11022010073 in words is "eleven billion, twenty-two million, ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •