Base | Representation |
---|---|
bin | 10000001010111111111… |
… | …001100110101100010111 |
3 | 10221020111212201210212222 |
4 | 100022333321212230113 |
5 | 121201441201030234 |
6 | 2210311152132555 |
7 | 143201400404666 |
oct | 20127771465427 |
9 | 3836455653788 |
10 | 1111321111319 |
11 | 399343882541 |
12 | 15b46b23715b |
13 | 80a493b2903 |
14 | 3bb06c84ddd |
15 | 1dd9481e42e |
hex | 102bfe66b17 |
1111321111319 has 8 divisors (see below), whose sum is σ = 1138440508800. Its totient is φ = 1084202380800.
The previous prime is 1111321111297. The next prime is 1111321111331. The reversal of 1111321111319 is 9131111231111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111321111319 - 28 = 1111321111063 is a prime.
It is a super-2 number, since 2×11113211113192 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111321111519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5661914 + ... + 5854904.
It is an arithmetic number, because the mean of its divisors is an integer number (142305063600).
Almost surely, 21111321111319 is an apocalyptic number.
1111321111319 is a deficient number, since it is larger than the sum of its proper divisors (27119397481).
1111321111319 is a wasteful number, since it uses less digits than its factorization.
1111321111319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333481.
The product of its digits is 162, while the sum is 26.
The spelling of 1111321111319 in words is "one trillion, one hundred eleven billion, three hundred twenty-one million, one hundred eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •