Base | Representation |
---|---|
bin | 1010000110110111001001… |
… | …1100000011011000010001 |
3 | 1110100101121002202021211211 |
4 | 2201231302130003120101 |
5 | 2424033411042214444 |
6 | 35345124125140121 |
7 | 2224613336261446 |
oct | 241556234033021 |
9 | 43311532667754 |
10 | 11113000351249 |
11 | 35a4aa6a8a355 |
12 | 12b59353ba641 |
13 | 627c4a3c9314 |
14 | 2a5c2d0139cd |
15 | 14411bdb4c34 |
hex | a1b72703611 |
11113000351249 has 2 divisors, whose sum is σ = 11113000351250. Its totient is φ = 11113000351248.
The previous prime is 11113000351241. The next prime is 11113000351273. The reversal of 11113000351249 is 94215300031111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10966648197649 + 146352153600 = 3311593^2 + 382560^2 .
It is a cyclic number.
It is not a de Polignac number, because 11113000351249 - 23 = 11113000351241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11113000351249.
It is not a weakly prime, because it can be changed into another prime (11113000351241) 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, 5556500175624 + 5556500175625.
It is an arithmetic number, because the mean of its divisors is an integer number (5556500175625).
Almost surely, 211113000351249 is an apocalyptic number.
It is an amenable number.
11113000351249 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113000351249 is an equidigital number, since it uses as much as digits as its factorization.
11113000351249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 11113000351249 in words is "eleven trillion, one hundred thirteen billion, three hundred fifty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •