Base | Representation |
---|---|
bin | 1010000001001011001100… |
… | …0100111000110110100101 |
3 | 1110000001102020100011011102 |
4 | 2200102303010320312211 |
5 | 2420433313420100203 |
6 | 35232205331245445 |
7 | 2214554262543062 |
oct | 240226304706645 |
9 | 43001366304142 |
10 | 11015300550053 |
11 | 3567620aa06a8 |
12 | 129aa09a49885 |
13 | 61b97a301377 |
14 | 2a1201673c69 |
15 | 1417eea8a888 |
hex | a04b3138da5 |
11015300550053 has 2 divisors, whose sum is σ = 11015300550054. Its totient is φ = 11015300550052.
The previous prime is 11015300549923. The next prime is 11015300550073. The reversal of 11015300550053 is 35005500351011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10082517388804 + 932783161249 = 3175298^2 + 965807^2 .
It is a cyclic number.
It is not a de Polignac number, because 11015300550053 - 212 = 11015300545957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11015300549998 and 11015300550025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11015300550073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507650275026 + 5507650275027.
It is an arithmetic number, because the mean of its divisors is an integer number (5507650275027).
Almost surely, 211015300550053 is an apocalyptic number.
It is an amenable number.
11015300550053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11015300550053 is an equidigital number, since it uses as much as digits as its factorization.
11015300550053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5625, while the sum is 29.
The spelling of 11015300550053 in words is "eleven trillion, fifteen billion, three hundred million, five hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •