Base | Representation |
---|---|
bin | 1010001001000101111011… |
… | …0001101111111010001101 |
3 | 1110111001112000201022211221 |
4 | 2202101132301233322031 |
5 | 2430200403222400023 |
6 | 35414503103443341 |
7 | 2230441143152425 |
oct | 242213661577215 |
9 | 43431460638757 |
10 | 11151325200013 |
11 | 360a2833a7489 |
12 | 13012502b6551 |
13 | 62b7473c271b |
14 | 2a7a26d27485 |
15 | 1451117a585d |
hex | a245ec6fe8d |
11151325200013 has 2 divisors, whose sum is σ = 11151325200014. Its totient is φ = 11151325200012.
The previous prime is 11151325199999. The next prime is 11151325200019. The reversal of 11151325200013 is 31000252315111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9033523158724 + 2117802041289 = 3005582^2 + 1455267^2 .
It is an emirp because it is prime and its reverse (31000252315111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11151325200013 - 25 = 11151325199981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11151325200019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5575662600006 + 5575662600007.
It is an arithmetic number, because the mean of its divisors is an integer number (5575662600007).
Almost surely, 211151325200013 is an apocalyptic number.
It is an amenable number.
11151325200013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11151325200013 is an equidigital number, since it uses as much as digits as its factorization.
11151325200013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 11151325200013 its reverse (31000252315111), we get a palindrome (42151577515124).
The spelling of 11151325200013 in words is "eleven trillion, one hundred fifty-one billion, three hundred twenty-five million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •