Base | Representation |
---|---|
bin | 10100100101011010… |
… | …00110010101101101 |
3 | 1001112011211200101001 |
4 | 22102231012111231 |
5 | 140113103334243 |
6 | 5024334120301 |
7 | 540600624055 |
oct | 122255062555 |
9 | 31464750331 |
10 | 11051230573 |
11 | 476114a109 |
12 | 2185050091 |
13 | 1071723bb6 |
14 | 76ba08565 |
15 | 44a30da4d |
hex | 292b4656d |
11051230573 has 2 divisors, whose sum is σ = 11051230574. Its totient is φ = 11051230572.
The previous prime is 11051230571. The next prime is 11051230583. The reversal of 11051230573 is 37503215011.
11051230573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6458051044 + 4593179529 = 80362^2 + 67773^2 .
It is a cyclic number.
It is not a de Polignac number, because 11051230573 - 21 = 11051230571 is a prime.
Together with 11051230571, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11051230571) 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, 5525615286 + 5525615287.
It is an arithmetic number, because the mean of its divisors is an integer number (5525615287).
Almost surely, 211051230573 is an apocalyptic number.
It is an amenable number.
11051230573 is a deficient number, since it is larger than the sum of its proper divisors (1).
11051230573 is an equidigital number, since it uses as much as digits as its factorization.
11051230573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 28.
Adding to 11051230573 its reverse (37503215011), we get a palindrome (48554445584).
The spelling of 11051230573 in words is "eleven billion, fifty-one million, two hundred thirty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •