Base | Representation |
---|---|
bin | 10100100100101101… |
… | …10101101000011101 |
3 | 1001111202212012102201 |
4 | 22102112311220131 |
5 | 140110110114343 |
6 | 5024005051501 |
7 | 540500210464 |
oct | 122226655035 |
9 | 31452765381 |
10 | 11045394973 |
11 | 47589237a8 |
12 | 21830b6b91 |
13 | 107045c992 |
14 | 76ad299db |
15 | 449a5994d |
hex | 2925b5a1d |
11045394973 has 2 divisors, whose sum is σ = 11045394974. Its totient is φ = 11045394972.
The previous prime is 11045394859. The next prime is 11045394979. The reversal of 11045394973 is 37949354011.
11045394973 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., 10841390884 + 204004089 = 104122^2 + 14283^2 .
It is an emirp because it is prime and its reverse (37949354011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11045394973 - 221 = 11043297821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11045394979) 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, 5522697486 + 5522697487.
It is an arithmetic number, because the mean of its divisors is an integer number (5522697487).
Almost surely, 211045394973 is an apocalyptic number.
It is an amenable number.
11045394973 is a deficient number, since it is larger than the sum of its proper divisors (1).
11045394973 is an equidigital number, since it uses as much as digits as its factorization.
11045394973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 11045394973 in words is "eleven billion, forty-five million, three hundred ninety-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •