Base | Representation |
---|---|
bin | 1010010100111100110101… |
… | …0100001111110010110101 |
3 | 1111012112100111001222202021 |
4 | 2211033031110033302311 |
5 | 2442020112024401211 |
6 | 40052233531313141 |
7 | 2251242361453162 |
oct | 245171524176265 |
9 | 44175314058667 |
10 | 11355043200181 |
11 | 368871295219a |
12 | 1334824bab7b1 |
13 | 644a11a985a5 |
14 | 2b3830b13069 |
15 | 14a586349771 |
hex | a53cd50fcb5 |
11355043200181 has 2 divisors, whose sum is σ = 11355043200182. Its totient is φ = 11355043200180.
The previous prime is 11355043200001. The next prime is 11355043200209. The reversal of 11355043200181 is 18100234055311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10583368797681 + 771674402500 = 3253209^2 + 878450^2 .
It is a cyclic number.
It is not a de Polignac number, because 11355043200181 - 229 = 11354506329269 is a prime.
It is a super-2 number, since 2×113550432001812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11355043240181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5677521600090 + 5677521600091.
It is an arithmetic number, because the mean of its divisors is an integer number (5677521600091).
Almost surely, 211355043200181 is an apocalyptic number.
It is an amenable number.
11355043200181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11355043200181 is an equidigital number, since it uses as much as digits as its factorization.
11355043200181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14400, while the sum is 34.
Adding to 11355043200181 its reverse (18100234055311), we get a palindrome (29455277255492).
The spelling of 11355043200181 in words is "eleven trillion, three hundred fifty-five billion, forty-three million, two hundred thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •