Base | Representation |
---|---|
bin | 10000000001101011010… |
… | …001000000100010000111 |
3 | 10220021200021102002112201 |
4 | 100001223101000202013 |
5 | 121020441134423034 |
6 | 2201534014055331 |
7 | 142365343104346 |
oct | 20015321004207 |
9 | 3807607362481 |
10 | 1101311248519 |
11 | 395077541459 |
12 | 159536aaa547 |
13 | 7cb12651181 |
14 | 3b4376b5b5d |
15 | 1d9aab64014 |
hex | 1006b440887 |
1101311248519 has 2 divisors, whose sum is σ = 1101311248520. Its totient is φ = 1101311248518.
The previous prime is 1101311248511. The next prime is 1101311248559. The reversal of 1101311248519 is 9158421131011.
It is a weak prime.
It is an emirp because it is prime and its reverse (9158421131011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101311248519 - 23 = 1101311248511 is a prime.
It is a super-2 number, since 2×11013112485192 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101311248511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550655624259 + 550655624260.
It is an arithmetic number, because the mean of its divisors is an integer number (550655624260).
Almost surely, 21101311248519 is an apocalyptic number.
1101311248519 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101311248519 is an equidigital number, since it uses as much as digits as its factorization.
1101311248519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 37.
The spelling of 1101311248519 in words is "one trillion, one hundred one billion, three hundred eleven million, two hundred forty-eight thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •