Base | Representation |
---|---|
bin | 1010001001000101111011… |
… | …0001101111111001111111 |
3 | 1110111001112000201022211102 |
4 | 2202101132301233321333 |
5 | 2430200403222344444 |
6 | 35414503103443315 |
7 | 2230441143152405 |
oct | 242213661577177 |
9 | 43431460638742 |
10 | 11151325199999 |
11 | 360a2833a7476 |
12 | 13012502b653b |
13 | 62b7473c270a |
14 | 2a7a26d27475 |
15 | 1451117a584e |
hex | a245ec6fe7f |
11151325199999 has 2 divisors, whose sum is σ = 11151325200000. Its totient is φ = 11151325199998.
The previous prime is 11151325199981. The next prime is 11151325200013. The reversal of 11151325199999 is 99999152315111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11151325199999 - 28 = 11151325199743 is a prime.
It is a super-2 number, since 2×111513251999992 (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 (11151325199699) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5575662599999 + 5575662600000.
It is an arithmetic number, because the mean of its divisors is an integer number (5575662600000).
Almost surely, 211151325199999 is an apocalyptic number.
11151325199999 is a deficient number, since it is larger than the sum of its proper divisors (1).
11151325199999 is an equidigital number, since it uses as much as digits as its factorization.
11151325199999 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8857350, while the sum is 65.
The spelling of 11151325199999 in words is "eleven trillion, one hundred fifty-one billion, three hundred twenty-five million, one hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •