Base | Representation |
---|---|
bin | 1010001110011011011111… |
… | …0011011111010111111101 |
3 | 1110210211011220202101002122 |
4 | 2203212313303133113331 |
5 | 2433201142331021023 |
6 | 35524545142332325 |
7 | 2240165226620612 |
oct | 243466763372775 |
9 | 43724156671078 |
10 | 11243013142013 |
11 | 36451538a5364 |
12 | 1316b7a42a0a5 |
13 | 637299b2ba43 |
14 | 2ac24408c509 |
15 | 1476cae032c8 |
hex | a39b7cdf5fd |
11243013142013 has 2 divisors, whose sum is σ = 11243013142014. Its totient is φ = 11243013142012.
The previous prime is 11243013142003. The next prime is 11243013142037. The reversal of 11243013142013 is 31024131034211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11057839560889 + 185173581124 = 3325333^2 + 430318^2 .
It is a cyclic number.
It is not a de Polignac number, because 11243013142013 - 214 = 11243013125629 is a prime.
It is a super-2 number, since 2×112430131420132 (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 (11243013142003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5621506571006 + 5621506571007.
It is an arithmetic number, because the mean of its divisors is an integer number (5621506571007).
Almost surely, 211243013142013 is an apocalyptic number.
It is an amenable number.
11243013142013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11243013142013 is an equidigital number, since it uses as much as digits as its factorization.
11243013142013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 11243013142013 its reverse (31024131034211), we get a palindrome (42267144176224).
The spelling of 11243013142013 in words is "eleven trillion, two hundred forty-three billion, thirteen million, one hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •